Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers (Lecture Notes in . Computer Science and General Issues)

Editore

Springer

Data di pubblicazione

2006

Lingua

Inglese

ISBN 10

3540483810

ISBN 13

9783540483816

Rilegatura

Paperback

Condizione

Very Good

Cataloghi dei venditori

Descrizione articolo

Riassunto

This book constitutes the thoroughly refereed post-proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006, held in Bergen, Norway in June 2006. The 30 revised full papers presented together with one invited paper were carefully selected from 91 submissions. The papers address all aspects of graph-theoretic concepts in computer science.

Contenuti

Treewidth: Characterizations, Applications, and Computations.- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy.- Generalised Dualities and Finite Maximal Antichains.- Chordal Deletion Is Fixed-Parameter Tractable.- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.- Divide-and-Color.- Listing Chordal Graphs and Interval Graphs.- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.- Improved Edge-Coloring with Three Colors.- Vertex Coloring of Comparability+ke and –ke Graphs.- Convex Drawings of Graphs with Non-convex Boundary.- How to Sell a Graph: Guidelines for Graph Retailers.- Strip Graphs: Recognition and Scheduling.- Approximating the Traffic Grooming Problem in Tree and Star Networks.- Bounded Arboricity to Determine the Local Structure of Sparse Graphs.- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.- Partitioned Probe Comparability Graphs.- Computing Graph Polynomials on Graphs of Bounded Clique-Width.- Generation of Graphs with Bounded Branchwidth.- Minimal Proper Interval Completions.- Monotony Properties of Connected Visible Graph Searching.- Finding Intersection Models of Weakly Chordal Graphs.- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs.- Clique Graph Recognition Is NP-Complete.- Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs.- Graph Labelings Derived from Models in Distributed Computing.- Flexible Matchings.- Simultaneous Graph Embeddings with Fixed Edges.- Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions.- Circular-Perfect Concave-Round Graphs.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

GuthrieBooks has served central Texas with a choice selection since 1978. We strive to provide an interesting selection and quality service. We specialize in academic works but carry books for all interests.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

GuthrieBooks
TX, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

At this time we accept payment through Visa or Mastercard.

Diritto di recesso

Condizioni di spedizione

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Tariffe di spedizione nazionale per U.S.A.

Tariffe di spedizione nazionale per U.S.A.
Quantit� dell?ordine	Da 4 a 14 giorni lavorativi	Da 3 a 6 giorni lavorativi
Primo articolo	EUR 5.96	EUR 11.92

I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.