Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Computation [[electronic resource] ] : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings / / edited by Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, Osamu Watanabe
| Algorithms and Computation [[electronic resource] ] : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings / / edited by Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, Osamu Watanabe |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XVIII, 775 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Artificial intelligence—Data processing Numerical analysis Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Data Science Numerical Analysis |
| ISBN | 3-642-25591-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Title page -- Preface -- Organization -- Table of Contents -- Invited Talk I -- Algorithm Engineering for Route Planning- An Update - -- References -- Invited Talk II -- Semidefinite Programming and Approximation Algorithms: A Survey -- References -- Approximation Algorithms I -- The School Bus Problem on Trees -- Introduction -- Our Results -- Related Work -- Preliminaries -- A 4-Approximation to the SBP on Trees -- A 12.5-Approximation to the Uncapacitated SBP-R on Trees -- References -- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph -- Introduction -- Shallow-Light Steiner Trees -- An O(logn)-Approximation for the (k, 2)-Subgraph Problem -- References -- Improved Approximation Algorithms for Routing Shop Scheduling -- Introduction -- Previous Work -- Our Results and Techniques -- Preliminaries -- Routing Open Shop -- Routing Flow Shop -- References -- Contraction-Based Steiner Tree Approximations in Practice -- Introduction -- History -- Contraction Framework -- Algorithm Engineering -- Experiments -- Conclusions and Thoughts -- References -- Computational Geometry I -- Covering and Piercing Disks with Two Centers -- Introduction -- Intersecting Disks with Two Centers -- Decision Algorithm -- Optimization Algorithm -- Covering Disks with Two Centers -- The General Case -- The Restricted Case -- References -- Generating Realistic Roofs over a Rectilinear Polygon -- Introduction -- Preliminaries -- Properties of Realistic Roofs -- Local Properties of Valleys and Ridges -- Global Structure of Realistic Roofs -- Enumerating Realistic Roofs and Computing Optimal Roofs -- References -- Computing the Visibility Polygon Using Few Variables -- Introduction -- Preliminaries -- An O(n) Algorithm Using O(1) Variables -- An O(n logr) Algorithm Using O(logr) Variables -- Closing Remarks.
References -- Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius -- Introduction -- Definitions and Results -- Layered Nearest Neighbor Algorithm -- Bounded Radius Network -- Conclusion -- References -- Graph Algorithms -- Hamiltonian Paths in the Square of a Tree -- Introduction -- Caterpillars and Horsetails -- 2H-Paths in (u,v)-Horsetails -- Efficient Algorithm for Horstail Queries -- References -- Dominating Induced Matchings for P7-free Graphs in Linear Time -- Introduction and Basic Notions -- Simple Properties of Graphs with Dominating Induced Matching -- Structure of P7-free Graphs with Dominating Induced Matching -- Distance Levels with Respect to an M-Edge in a P3 -- Edges in and between Ti and Tj, i =j -- The Algorithm for the General P7-free Case -- Conclusion -- References -- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths -- Introduction -- Preliminaries -- Set-Restricted Disjoint Paths -- Contractions and Induced Minors in Chordal Graphs -- Concluding Remarks -- References -- Recognizing Polar Planar Graphs Using New Results for Monopolarity -- Introduction -- Hardness Results -- A 2-SAT Approach and a Superclass of Chair-Free Graphs -- A Superclass of Hole-Free Graphs -- Some Efficiently Solvable Cases of Polarity for Planar Graphs -- Conclusion -- References -- Robustness of Minimum Cost Arborescences -- Introduction -- Fulkerson's Algorithm -- A Sufficient Condition is Necessary -- A Necessary Condition is Sufficient -- References -- Data Structures I -- Path Queries in Weighted Trees -- Introduction -- Previous Work -- Our Results -- Properties of Ordinal Trees -- A Pointer Machine Data Structure -- Optimizations in the RAM model -- Linear Space, but Slower Reporting -- Slightly More Space, Much Faster Reporting -- References -- Dynamic Range Majority Data Structures. Introduction -- Previous Work -- Our Results -- Dynamic Data Structures in One Dimension -- Supporting Queries -- Supporting Updates -- Speedup for Integer Coordinates -- Dynamic Data Structures in Higher Dimensions -- References -- Dynamic Range Selection in Linear Space -- Introduction -- Previous Work -- Our Results -- Linear Space Data Structure -- Space Efficient Ranking Trees -- Answering Queries -- Handling Updates -- Dynamic Arrays -- Concluding Remarks -- References -- A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time -- Introduction -- A Data Structure with Optimal Query Time -- Compact Representation -- References -- Encoding 2D Range Maximum Queries -- Introduction -- Random Input -- Small m -- Data Structures for 2D-RMQ -- Conclusions and Open Problems -- References -- Distributed Systems -- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions -- Introduction -- Precise Model and Results -- The Diameter of the Largest Connected Component -- References -- Broadcasting in Heterogeneous Tree Networks with Uncertainty -- Introduction -- Preliminaries -- Finding a Minmax-Regret Broadcast Center -- Correctness -- Time Complexity -- Conclusion -- References -- Optimal File Distribution in Peer-to-Peer Networks -- Introduction -- Homogeneous Symmetric Capacities -- Heterogeneous Symmetric Capacities -- References -- Computational Geometry II -- Animal Testing -- Introduction -- Algorithm 1 Based on Fundamental Polygonsand Davenport-Schinzel Sequences -- Algorithm 2 Based on Euler-Poincaré Formula -- References -- Cutting Out Polygons with a Circular Saw -- Introduction -- Preliminaries -- Algorithm -- References -- Fast Fréchet Queries -- Introduction -- Preliminaries -- The Data Structure -- Making Part of the Query -- Relative Error -- References -- Graph Drawing and Information Visualization. Angle-Restricted Steiner Arborescences for Flow Map Layout -- Introduction -- Optimal Flux Trees -- Spiral Trees -- Computing Spiral Trees -- Approximating Spiral Trees in the Presenceof Obstacles -- Rectilinear Steiner Arborescences -- Spiral Trees -- References -- Treemaps with Bounded Aspect Ratio -- Introduction -- Convex Treemaps -- Ortho-Convex Treemaps -- Conclusions -- References -- Simultaneous Embedding of Embedded Planar Graphs -- Introduction and Overview -- Preliminaries -- Computing a Sefe-Fe of Three Embedded Planar Graphs -- Sefe-Fe and Sge-Fe of k Embedded Graphs Is NP-Hard -- References -- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations -- Introduction -- Representations for Maximal Planar Graphs -- Representations of Planar 3-trees -- Representations for Maximal Outer-Planar Graphs -- Conclusion -- References -- Data Structures II -- Fully Retroactive Approximate Range and Nearest Neighbor Searching -- Introduction -- Related Work -- Our Results -- A General Approach to Retroactivity -- Main Results -- References -- Compact Representation of Posets -- Introduction -- Our Work in Context -- Contributions -- Preliminaries -- Posets -- Transitive Reductions -- Succinct Data Structures -- The Representation -- Storing the Chains -- Storing the Order Relation between Chains -- Operations -- Operation reachability(x,y) -- Operations succG(x) and predG(x) -- Operation range(x,y) -- Operation adjGr(x,y) -- Operations succGr(x) and predGr(x) -- Operations a-succGr(x) and a-predGr(x) -- Operations LUB(x1, ..., xt) and GLB(x1, ..., xt) -- Operations a-LUB(x1, ..., xt) and a-GLB(x1, ..., xt) -- Summary and Open Questions -- References -- Explicit Array-Based Compact Data Structures for Triangulations -- Introduction -- Existing Mesh Data Structures -- Preliminaries -- Compactly Representing Triangulations. The First Data Structure: Simple and Still Redundant -- More Compact Solutions, via Minimal Schnyder Woods -- Further Reducing the Space Requirement -- Experimental Results -- References -- Space-Efficient Data-Analysis Queries on Grids -- Introduction -- Wavelet Trees -- Representation of Grids -- Dynamism -- Statistical Queries -- Range Sum, Average, and Variance -- Range Minima and Maxima -- Range Median and Quantiles -- Range Majority -- Range Successor and Predecessor -- Dynamism -- Final Remarks -- References -- Parameterized Algorithms I -- A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments -- Introduction -- Preliminaries -- Modular Partitions -- Reductions and Kernel -- Data Reduction Rules -- Analysis of Kernel Size -- Conclusion -- References -- Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments -- Introduction -- Preliminaries -- Canonical Sequence for Acyclic Bipartite Tournament -- Allying Sequence of Node Sets and Increasing Subsequence of Node Sets -- Consistent Node Sequence and Compatible Node Sequence -- A Reduction -- Framework of Our Proof for the Main Lemma -- Good Sequence -- Framework for Proving the Main Lemma -- Dynamic Programming for Proving Lemma 4 -- References -- Parameterized Algorithms for Inclusion of Linear Matchings -- Introduction -- Problem Definition -- Algorithms for Linear Matching Inclusion -- An FPT Algorithm for Parameters d and k -- An FPT Algorithm for Parameter p -- An Algorithm for Nesting-Free Patterns -- Hardness Results -- Hardness of Linear Matching Inclusion -- Hardness of Nesting-Free 2-Interval Pattern -- References -- Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem -- Introduction -- Preliminaries -- Algorithms Implemented -- Computational Results -- Results for Longest Paths -- Results for Grid/Cylinder Minors. Concluding Remarks. |
| Record Nr. | UNISA-996466265103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Aquatic Biodiversity Conservation and Ecosystem Services [[electronic resource] /] / edited by Shin-ichi Nakano, Tetsukazu Yahara, Tohru Nakashizuka
| Aquatic Biodiversity Conservation and Ecosystem Services [[electronic resource] /] / edited by Shin-ichi Nakano, Tetsukazu Yahara, Tohru Nakashizuka |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (129 p.) |
| Disciplina | 577.6 |
| Collana | Asia-Pacific Biodiversity Observation Network |
| Soggetto topico |
Biodiversity
Environmental management Aquatic ecology Environmental monitoring Environmental Management Freshwater & Marine Ecology Monitoring/Environmental Analysis |
| ISBN | 981-10-0780-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part 1 Local Biodiversity and Its Threats -- 1 Aquatic Macrophytes and Fish Diversity of Various Tropical Lakes at the Main Islands in Indonesia -- 2 Status of Freshwater Fish Biodiversity in the Yangtze River Basin, China -- 3 Freshwater Fish Diversity in Thailand and the Challenges on its Prosperity Due to River Damming -- 4 Potential Future Coral Habitats Around Japan Depend Strongly on Anthropogenic CO2 Emissions -- Part 2 Advanced Methods of Biodiversity Monitoring -- 5 Classification of Seagrass Beds by Coupling Airborne Lidar Bathymetry Data and Digital Aerial Photographs -- 6 Cyanobacterial Blooms as an Indicator of Environmental Degradation In Waters and Their Monitoring Using Satellite Remote Sensing -- Part 3 Ecosystem Service and Socioeconomic Aspects with Special Reference to Biodiversity -- 7 Utilization of Freshwater Fishes Biodiversity as Income Source of Poor Rural People (Case Study in Pampangan Subdistrict of South Sumatra Province, Indonesia) -- 8 Why People Visit Zoos: An Empirical Approach Using the Travel Cost Method for the Higashiyama Zoo, Nagoya, Japan -- 9 Tourist Perceptions of Traditional Japanese Vegetable Brands: A Quantitative Approach to Kaga Vegetable Brands and an Information Channel for Tourists at the Noto Giahs Site -- BM Index. |
| Record Nr. | UNINA-9910253868703321 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Biodiversity in Aquatic Systems and Environments [[electronic resource] ] : Lake Biwa / / by Noboru Okuda, Katsutoshi Watanabe, Kayoko Fukumori, Shin-ichi Nakano, Takefumi Nakazawa
| Biodiversity in Aquatic Systems and Environments [[electronic resource] ] : Lake Biwa / / by Noboru Okuda, Katsutoshi Watanabe, Kayoko Fukumori, Shin-ichi Nakano, Takefumi Nakazawa |
| Autore | Okuda Noboru |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Tokyo : , : Springer Japan : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (99 p.) |
| Disciplina | 576.8 |
| Collana | SpringerBriefs in Biology |
| Soggetto topico |
Aquatic ecology
Evolutionary biology Microbial ecology Freshwater & Marine Ecology Evolutionary Biology Microbial Ecology |
| ISBN | 4-431-54150-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Origin and diversification of freshwater fishes in Lake Biwa -- 2 Predator diversity changes the world: From gene to ecosystem -- 3 Biodiversity researches on microbial loop in aquatic systems -- 4 A dynamic resilience perspective toward integrated ecosystem management: Biodiversity, landscape, and climate. |
| Record Nr. | UNINA-9910298307603321 |
Okuda Noboru
|
||
| Tokyo : , : Springer Japan : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integrative Observations and Assessments [[electronic resource] /] / edited by Shin-ichi Nakano, Tetsukazu Yahara, Tohru Nakashizuka
| Integrative Observations and Assessments [[electronic resource] /] / edited by Shin-ichi Nakano, Tetsukazu Yahara, Tohru Nakashizuka |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Tokyo : , : Springer Japan : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (429 p.) |
| Disciplina | 333.9511 |
| Collana | Asia-Pacific Biodiversity Observation Network |
| Soggetto topico |
Biodiversity
Environmental monitoring Monitoring/Environmental Analysis |
| Soggetto genere / forma | Case studies. |
| ISBN | 4-431-54783-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Part 1 General introduction: perspectives for spatial variability within an ecosystem and interdependence between various ecosystems -- 1 Asian biodiversity network as the linkage with other major global bodies -- 2 Effects of ecosystem diversity on species richness and ecosystem functioning and services: a general conceptualization -- Part 2 Status quo of biodiversity monitoring -- 3 Monitoring breeding bird population in Taiwan -- 4 Current status of the national coral database in Japan: dataset development, applications and future directions -- 5 Development of a large-scale, long-term coral cover and disturbance database in the Philippines -- 6 Zooxanthellate scleractinian corals of Jeju Island, Republic of Korea -- 7 Landscape mosaicness in the ocean: its significance for biodiversity patterns in benthic organisms and fish -- Part 3 Historical changes in biodiversity and challenges for biodiversity conservation -- 8 Long-term and spatial variation in the diversity of littoral benthic macroinvertebrate fauna in Lake Biwa, Japan -- 9 Research on the biodiversity of the seas surrounding Malaysia -- Part 4 Advanced concept and methods of integrated biodiversity monitoring -- 10 Development of a national land-use/cover dataset to estimate biodiversity and ecosystem services -- 11 Land cover classification using multi-temporal satellite images in a subtropical region -- 12 Impervious surface area as an indicator for evaluating drainage basins -- 13 Biodiversity of Kargil Cold Desert in the Ladakh Himalaya -- 14 Water circulation in a fringing reef and implications for coral distribution and resilience -- 15 An integrated indicator of biodiversity in agricultural ponds: definition and validation -- 16 Ubiquitous genotyping for conservation of endangered plant species -- 17 Eco-evolutionary genomic observation for local and global environmental changes -- Part 5 Ecosystem service and socio-economic aspects with special reference to biodiversity -- 18 Monitoring changes in ecosystem services within a forest ecosystem -- 19 Evaluating relationship between biodiversity and ecosystem functions in forests using forest inventory and allometry data -- 20 Regional comparison of the ecosystem services from seagrass beds in Asia -- 21 Environmental disclosure in Japanese wood-related companies for 2005 and 2010 -- 22 Greening the cities with biodiversity indicators: experience and challenges from Japanese cities with CBI -- BM Index. |
| Record Nr. | UNINA-9910298347303321 |
| Tokyo : , : Springer Japan : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithm and Computation [[electronic resource] ] : 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings / / edited by Md. Saidur Rahman, Shin-ichi Nakano
| WALCOM: Algorithm and Computation [[electronic resource] ] : 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings / / edited by Md. Saidur Rahman, Shin-ichi Nakano |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 241 p. 67 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer Science |
| ISBN | 3-642-28076-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465701603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings / / edited by Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano
| WALCOM: Algorithms and Computation [[electronic resource] ] : 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings / / edited by Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XV, 420 p. 298 illus., 64 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Mathematical Applications in Computer Science Data Science |
| ISBN | 3-030-10564-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Facility Location Problem -- Computational Geometry -- Graph Drawing -- Graph Algorithms -- Approximation Algorithms -- Miscellaneous -- Data Structures -- Parallel and Distributed Algorithms -- Packing and Covering. |
| Record Nr. | UNISA-996466430003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings / / edited by Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano
| WALCOM: Algorithms and Computation : 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings / / edited by Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XV, 420 p. 298 illus., 64 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Mathematical Applications in Computer Science Data Science |
| ISBN | 3-030-10564-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Facility Location Problem -- Computational Geometry -- Graph Drawing -- Graph Algorithms -- Approximation Algorithms -- Miscellaneous -- Data Structures -- Parallel and Distributed Algorithms -- Packing and Covering. |
| Record Nr. | UNINA-9910337570103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / / edited by Shin-ichi Nakano, Md. Saidur Rahman
| WALCOM: Algorithms and Computation [[electronic resource] ] : Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / / edited by Shin-ichi Nakano, Md. Saidur Rahman |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XII, 244 p.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Software Engineering Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-77891-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Vertex Domination in Dynamic Networks -- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis -- Simple Geometrical Intersection Graphs -- Bioinformatics Algorithms -- On the Approximability of Comparing Genomes with Duplicates -- Indexing Circular Patterns -- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs -- Computational Geometry and Graph Drawing -- Cover Ratio of Absolute Neighbor -- Computing ?-Drawings of 2-Outerplane Graphs in Linear Time -- Upward Drawings of Trees on the Minimum Number of Layers -- Guarding Exterior Region of a Simple Polygon -- Computing Nice Projections of Convex Polyhedra -- Graph Algorithms I -- A Compact Encoding of Plane Triangulations with Efficient Query Supports -- Four-Connected Spanning Subgraphs of Doughnut Graphs -- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs -- Algorithm Engineering -- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem -- Multi-commodity Source Location Problems and Price of Greed -- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs -- Optimal Algorithms for Detecting Network Stability -- On Certain New Models for Paging with Locality of Reference -- Graph Algorithms II -- Listing All Plane Graphs -- Pairwise Compatibility Graphs -- Multilevel Bandwidth and Radio Labelings of Graphs. |
| Record Nr. | UNISA-996465630603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / / edited by Shin-ichi Nakano, Md. Saidur Rahman
| WALCOM: Algorithms and Computation : Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / / edited by Shin-ichi Nakano, Md. Saidur Rahman |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XII, 244 p.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Software Engineering Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-77891-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Vertex Domination in Dynamic Networks -- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis -- Simple Geometrical Intersection Graphs -- Bioinformatics Algorithms -- On the Approximability of Comparing Genomes with Duplicates -- Indexing Circular Patterns -- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs -- Computational Geometry and Graph Drawing -- Cover Ratio of Absolute Neighbor -- Computing ?-Drawings of 2-Outerplane Graphs in Linear Time -- Upward Drawings of Trees on the Minimum Number of Layers -- Guarding Exterior Region of a Simple Polygon -- Computing Nice Projections of Convex Polyhedra -- Graph Algorithms I -- A Compact Encoding of Plane Triangulations with Efficient Query Supports -- Four-Connected Spanning Subgraphs of Doughnut Graphs -- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs -- Algorithm Engineering -- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem -- Multi-commodity Source Location Problems and Price of Greed -- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs -- Optimal Algorithms for Detecting Network Stability -- On Certain New Models for Paging with Locality of Reference -- Graph Algorithms II -- Listing All Plane Graphs -- Pairwise Compatibility Graphs -- Multilevel Bandwidth and Radio Labelings of Graphs. |
| Record Nr. | UNINA-9910768471903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||