Graph-theoretic concepts in computer science : 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings / / edited by Juraj HromkovicÌ; Ondrej SyÌkora |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1998] |
Descrizione fisica | 1 online resource (X, 394 p.) |
Disciplina | 004.0151 |
Collana | Lecture notes in computer science |
Soggetto topico |
Electronic data processing
Graph theory |
ISBN | 3-540-49494-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width -- Minus Domination in Small-Degree Graphs -- The Vertex-Disjoint Triangles Problem -- Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode -- Broadcasting on Anonymous Unoriented Tori -- Families of Graphs Having Broadcasting and Gossiping Properties -- Optical All-to-All Communication in Inflated Networks -- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking -- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees -- Rankings of Directed Graphs -- Drawing Planar Partitions II: HH-Drawings -- Triangles in Euclidean Arrangements -- Internally Typed Second-Order Term Graphs -- Compact Implicit Representation of Graphs -- Graphs with Bounded Induced Distance -- Diameter Determination on Restricted Graph Families -- Independent Tree Spanners -- Upgrading Bottleneck Constrained Forests -- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition -- Improved Compressions of Cube-Connected Cycles Networks -- Efficient Embeddings of Grids into Grids -- Integral Uniform Flows in Symmetric Networks -- Splitting Number is NP-Complete -- Tree Spanners in Planar Graphs -- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs -- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases -- Domination and Steiner Tree Problems on Graphs with Few P 4s -- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs -- Interval Completion with the Smallest Max-Degree -- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. |
Record Nr. | UNINA-9910143468803321 |
Berlin, Germany ; ; New York, New York : , : Springer, , [1998] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph-theoretic concepts in computer science : 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings / / edited by Juraj HromkovicÌ; Ondrej SyÌkora |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1998] |
Descrizione fisica | 1 online resource (X, 394 p.) |
Disciplina | 004.0151 |
Collana | Lecture notes in computer science |
Soggetto topico |
Electronic data processing
Graph theory |
ISBN | 3-540-49494-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width -- Minus Domination in Small-Degree Graphs -- The Vertex-Disjoint Triangles Problem -- Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode -- Broadcasting on Anonymous Unoriented Tori -- Families of Graphs Having Broadcasting and Gossiping Properties -- Optical All-to-All Communication in Inflated Networks -- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking -- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees -- Rankings of Directed Graphs -- Drawing Planar Partitions II: HH-Drawings -- Triangles in Euclidean Arrangements -- Internally Typed Second-Order Term Graphs -- Compact Implicit Representation of Graphs -- Graphs with Bounded Induced Distance -- Diameter Determination on Restricted Graph Families -- Independent Tree Spanners -- Upgrading Bottleneck Constrained Forests -- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition -- Improved Compressions of Cube-Connected Cycles Networks -- Efficient Embeddings of Grids into Grids -- Integral Uniform Flows in Symmetric Networks -- Splitting Number is NP-Complete -- Tree Spanners in Planar Graphs -- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs -- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases -- Domination and Steiner Tree Problems on Graphs with Few P 4s -- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs -- Interval Completion with the Smallest Max-Degree -- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. |
Record Nr. | UNISA-996466109503316 |
Berlin, Germany ; ; New York, New York : , : Springer, , [1998] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|