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.
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 334 p.) |
| Disciplina | 004.015115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Data structures (Computer science) Algorithms Computer science—Mathematics Programming Techniques Theory of Computation Data Structures and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures |
| ISBN | 3-540-45477-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs. |
| Record Nr. | UNISA-996465886903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le
| Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 334 p.) |
| Disciplina | 004.015115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Data structures (Computer science) Algorithms Computer science—Mathematics Programming Techniques Theory of Computation Data Structures and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures |
| ISBN | 3-540-45477-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs. |
| Record Nr. | UNINA-9910767577903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||