Graph-Theoretic Concepts in Computer Science
Editat de Fedor V. Fominen Limba Engleză Paperback – 3 noi 2006
Preț: 325.06 lei
Preț vechi: 406.33 lei
-20% Nou
Puncte Express: 488
Preț estimativ în valută:
57.52€ • 67.54$ • 50.49£
57.52€ • 67.54$ • 50.49£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540483816
ISBN-10: 3540483810
Pagini: 376
Ilustrații: XIII, 358 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540483810
Pagini: 376
Ilustrații: XIII, 358 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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-RoundGraphs.