Cargando…
Graph-Theoretic Concepts in Computer Science 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers /
This book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008. The 30 revised full papers presented together with 3 invited paper were carefully reviewed and...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2008.
|
| Edición: | 1st ed. 2008. |
| Colección: | Theoretical Computer Science and General Issues,
5344 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-92248-3 | ||
| 003 | DE-He213 | ||
| 005 | 20230223032125.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2008 gw | s |||| 0|eng d | ||
| 020 | |a 9783540922483 |9 978-3-540-92248-3 | ||
| 024 | 7 | |a 10.1007/978-3-540-92248-3 |2 doi | |
| 050 | 4 | |a QA76.9.A43 | |
| 072 | 7 | |a UMB |2 bicssc | |
| 072 | 7 | |a COM051300 |2 bisacsh | |
| 072 | 7 | |a UMB |2 thema | |
| 082 | 0 | 4 | |a 518.1 |2 23 |
| 245 | 1 | 0 | |a Graph-Theoretic Concepts in Computer Science |h [electronic resource] : |b 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / |c edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma. |
| 250 | |a 1st ed. 2008. | ||
| 264 | 1 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg : |b Imprint: Springer, |c 2008. | |
| 300 | |a XIII, 386 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 5344 | |
| 505 | 0 | |a Invited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. | |
| 520 | |a This book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008. The 30 revised full papers presented together with 3 invited paper were carefully reviewed and selected from 76 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations. | ||
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Computer science-Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 0 | |a Numerical analysis. | |
| 650 | 0 | |a Artificial intelligence-Data processing. | |
| 650 | 0 | |a Computer graphics. | |
| 650 | 1 | 4 | |a Algorithms. |
| 650 | 2 | 4 | |a Discrete Mathematics in Computer Science. |
| 650 | 2 | 4 | |a Numerical Analysis. |
| 650 | 2 | 4 | |a Data Science. |
| 650 | 2 | 4 | |a Computer Graphics. |
| 700 | 1 | |a Broersma, Hajo. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Erlebach, Thomas. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Friedetzky, Tom. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Paulusma, Daniel. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783540922490 |
| 776 | 0 | 8 | |i Printed edition: |z 9783540922476 |
| 830 | 0 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 5344 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-540-92248-3 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-LNC | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||