Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

40

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540310006, 9783540314684

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Locally Consistent Constraint Satisfaction Problems with Binary Constraints

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_26 ◽

2005 ◽

pp. 295-306 ◽

Author(s):

Manuel Bodirsky ◽

Daniel Král’

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Binary Constraints ◽

Consistent Constraint

Download Full-text

Optimal Hypergraph Tree-Realization

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_23 ◽

2005 ◽

pp. 261-270

Author(s):

Ephraim Korach ◽

Margarita Razgon

Download Full-text

Acyclic Choosability of Graphs with Small Maximum Degree

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_21 ◽

2005 ◽

pp. 239-248

Author(s):

Daniel Gonçalves ◽

Mickaël Montassier

Keyword(s):

Download Full-text

Computing Branchwidth Via Efficient Triangulations and Blocks

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_33 ◽

2005 ◽

pp. 374-384 ◽

Author(s):

Fedor Fomin ◽

Frédéric Mazoit ◽

Ioan Todinca

Download Full-text

Hypertree Decompositions: Structure, Algorithms, and Applications

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_1 ◽

2005 ◽

pp. 1-15 ◽

Author(s):

Georg Gottlob ◽

Martin Grohe ◽

Nysret Musliu ◽

Marko Samer ◽

Francesco Scarcello

Download Full-text

On Stable Cutsets in Claw-Free Graphs and Planar Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_15 ◽

2005 ◽

pp. 163-174

Author(s):

Van Bang Le ◽

Raffaele Mosca ◽

Haiko Müller

Keyword(s):

Download Full-text

Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_9 ◽

2005 ◽

pp. 91-102 ◽

Author(s):

Daniel Meister

Keyword(s):

Linear Time ◽

Permutation Graphs

Download Full-text

On Randomized Broadcasting in Star Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_27 ◽

2005 ◽

pp. 307-318 ◽

Author(s):

Robert Elsässer ◽

Thomas Sauerwald

Keyword(s):

Download Full-text

Approximating Rank-Width and Clique-Width Quickly

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_5 ◽

2005 ◽

pp. 49-58 ◽

Author(s):

Sang-il Oum

Download Full-text

Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/11604686_4 ◽

2005 ◽

pp. 38-48 ◽

Author(s):

Christophe Crespelle ◽

Christophe Paul

Keyword(s):

Permutation Graphs ◽

Dynamic Algorithm ◽

Modular Decomposition

Download Full-text