Graph-Theoretic Concepts in Computer Science
Editat de Hans L. Bodlaenderen Limba Engleză Paperback – 29 oct 2003
Preț: 327.48 lei
Preț vechi: 409.36 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540204527
ISBN-10: 3540204520
Pagini: 404
Ilustrații: XII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540204520
Pagini: 404
Ilustrații: XII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lecture.- Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT.- Matching, Edge-Colouring, and Dimers.- Regular Papers.- Minimum Flow Time Graph Ordering.- Searching Is Not Jumping.- Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars.- The Minimum Degree Heuristic and the Minimal Triangulation Process.- Generalized Parametric Multi-terminal Flows Problem.- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.- The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.- Tree Spanners for Bipartite Graphs and Probe Interval Graphs.- A Simple Linear Time LexBFS Cograph Recognition Algorithm.- Backbone Colorings for Networks.- Greedy Edge-Disjoint Paths in Complete Graphs.- Graph-Based Approaches to Software Watermarking.- Completely Connected Clustered Graphs.- An FPT Algorithm for Set Splitting.- Drawing Planar Graphs on a Curve.- Tree-Partitions of k-Trees with Applications in Graph Layout.- Resource Allocation Problems in Multifiber WDM Tree Networks.- An Improved Upper Bound on the Crossing Number of the Hypercube.- NCE Graph Grammars and Clique-Width.- Chordal Probe Graphs.- Subgraph Induced Planar Connectivity Augmentation.- On the Recognition of General Partition Graphs.- Short Cycles in Planar Graphs.- Complexity of Hypergraph Coloring and Seidel’s Switching.- Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.- The Complexity of Graph Contractions.- Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.- The Probabilistic Minimum Coloring Problem.- Recognizing Bipolarizable and P 4-Simplicial Graphs.- Coloring Powers of Graphs of Bounded Clique-Width.- Erratum.- Erratum: Cycles in GeneralizedNetworks.