Graph-Theoretic Concepts in Computer Science
Editat de Andreas Brandstädt, Van Bang Leen Limba Engleză Paperback – 26 sep 2001
The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.
Preț: 324.66 lei
Preț vechi: 405.83 lei
-20%
Puncte Express: 487
Carte tipărită la comandă
Livrare economică 07-21 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: 9783540427070
ISBN-10: 3540427074
Pagini: 344
Ilustrații: X, 334 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540427074
Pagini: 344
Ilustrații: X, 334 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Head First HTML and CSSElisabeth Robson-20%Preț: 287.49 lei359.36 lei -
KanbanDavid J. Anderson-20%Preț: 254.39 lei317.98 lei -
OcpJeanne BoyarskyPreț: 295.34 lei -
Professional GitBrent Laster-20%Preț: 256.30 lei320.38 lei -
Pro ASP.NET Web API SecurityBadrinarayanan Lakshmiraghavan-20%Preț: 525.86 lei657.33 lei -
Android CookbookIan F Darwin-20%Preț: 420.08 lei525.10 lei -
Continuous Delivery with Visual Studio ALM 2015Mathias Olausson-20%Preț: 299.70 lei374.63 lei -
The Enterprise Big Data LakeAlex Gorelik-20%Preț: 357.88 lei447.34 lei -
Feature Engineering for Machine LearningAlice Zheng-20%Preț: 329.29 lei411.62 lei -
Mastering ServiceNow - Second EditionMartin Wood-20%Preț: 368.74 lei460.93 lei -
Graphen und AlgorithmenAndreas BrandstädtPreț: 469.42 lei -
Objektorientiertes ProgrammierenUte Claussen-20%Preț: 228.95 lei286.19 lei -
EntwurfsmusterKlaus Quibeldey-Cirkel-20%Preț: 448.82 lei561.03 lei -
-20%Preț: 323.73 lei404.66 lei -
Complexity of ConstraintsNadia Creignou-20%Preț: 323.81 lei404.76 lei -
Replication: Theory and PracticeBernadette Charron-Bost-20%Preț: 513.21 lei641.51 lei -
-20%Preț: 324.82 lei406.03 lei -
-20%Preț: 324.99 lei406.23 lei -
Graph-Theoretic Concepts in Computer ScienceAndreas Brandstädt-20%Preț: 329.94 lei412.42 lei
Public țintă
ResearchCuprins
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces.- Data Management in Networks.- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.- Approximate Constrained Bipartite Edge Coloring.- Maximum Clique Transversals.- On the Tree-Degree of Graphs.- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.- (k+) -Disatance- Herediatry Graphs.- On the Relationship between Clique-Width and Treewidth.- Planarity of the 2-Level Cactus Model.- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.- (g, f)-Factorizations Orthogonal to k Subgraphs.- On Star Coloring of Graphs.- Graph Subcolorings: Complexity and Algorithms.- Approximation of Pathwidth of Outerplanar Graphs.- On the Monotonicity of Games Generated by Symmetric Submodular Functions.- Multiple Hotlink Assignment.- Small k-Dominating Sets in Planar Graphs with Applications.- Lower Bounds for Algorithms for the Steiner Tree Problem.- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time.- On Subfamilies of AT-Free Graphs.- Complexity of Coloring Graphs without Forbidden Induced Subgraphs.- On Stable Cutsets in Line Graphs.- On Strong Menger-Connectivity of Star Graphs.- The Complexity of the Matching-Cut Problem.- De Bruijn Graphs and DNA Graphs.- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.- Critical and Anticritical Edges in Perfect Graphs.