Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers / Luděk Kučera (ed.).
Contributor(s): Kučera, LuděkMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 2573.Publisher: Berlin : Springer, 2002Description: 1 online resource (xi, 422 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540363798; 3540363793Other title: WG 2002Subject(s): Computer science -- Congresses | Graph theory -- Congresses | Graph theory -- Data processing -- Congresses | Computer science | Graph theory | Graph theory -- Data processingGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Graph-theoretic concepts in computer science.DDC classification: 004.015115 LOC classification: QA166 | .G7172 2002Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Print version record.
This book constitutes the refereed proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, held in Cesky Krumlov, Czech Republic in June 2002. The 36 revised full papers presented were carefully selected from initially 61 submissions during two rounds of reviewing and improvement. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields.
Maximum Cardinality Search for Computing Minimal Triangulations -- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem -- On the Minimum Size of a Contraction-Universal Tree -- Optimal Area Algorithm for Planar Polyline Drawings -- Cycles in Generalized Networks -- New Graph Classes of Bounded Clique-Width -- More about Subcolorings -- Search in Indecomposable Graphs -- On the Complexity of (k, l)-Graph Sandwich Problems -- Algorithms and Models for the On-Line Vertex-Covering -- Weighted Node Coloring: When Stable Sets Are Expensive -- The Complexity of Restrictive H-Coloring -- A New 3-Color Criterion for Planar Graphs -- An Additive Stretched Routing Scheme for Chordal Graphs -- Complexity of Pattern Coloring of Cycle Systems -- Safe Reduction Rules for Weighted Treewidth -- Graph Separator Algorithms: A Refined Analysis -- Generalized H-Coloring and H-Covering of Trees -- The Complexity of Approximating the Oriented Diameter of Chordal Graphs -- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies -- Completely Independent Spanning Trees in Maximal Planar Graphs -- Facets of the Directed Acyclic Graph Layering Polytope -- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP -- Complexity of Some Infinite Games Played on Finite Graphs -- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs -- A Multi-scale Algorithm for the Linear Arrangement Problem -- On the b-Chromatic Number of Graphs -- Budgeted Maximum Graph Coverage -- Online Call Admission in Optical Networks with Larger Demands -- The Forest Wrapping Problem on Outerplanar Graphs -- On the Recognition of P 4 -Comparability Graphs -- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs -- Cluster Graph Modification Problems -- Two Counterexamples in Graph Drawing -- Connected and Loosely Connected List Homomorphisms -- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.