Completely Connected Clustered Graphs (English)
- New search for: Cornelsen, Sabine
- New search for: Wagner, Dorothea
- New search for: Cornelsen, Sabine
- New search for: Wagner, Dorothea
In:
Graph-Theoretic Concepts in Computer Science
2
;
168-179
;
2003
- Article/Chapter (Book) / Electronic Resource
-
Title:Completely Connected Clustered Graphs
-
Contributors:Cornelsen, Sabine ( author ) / Wagner, Dorothea ( author )
-
Published in:Graph-Theoretic Concepts in Computer Science , 2 ; 168-179Lecture Notes in Computer Science ; 2880, 2 ; 168-179
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2003-01-01
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPTFellows, Michael R. et al. | 2003
- 13
-
Matching, Edge-Colouring, and DimersSchrijver, Alexander et al. | 2003
- 23
-
Minimum Flow Time Graph OrderingArbib, Claudio / Flammini, Michele / Marinelli, Fabrizio et al. | 2003
- 34
-
Searching Is Not JumpingBarrière, Lali / Fraigniaud, Pierre / Santoro, Nicola / Thilikos, Dimitrios M. et al. | 2003
- 46
-
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph GrammarsBecker, Simon M. / Westfechtel, Bernhard et al. | 2003
- 58
-
The Minimum Degree Heuristic and the Minimal Triangulation ProcessBerry, Anne / Heggernes, Pinar / Simonet, Geneviève et al. | 2003
- 71
-
Generalized Parametric Multi-terminal Flows ProblemBerthomé, Pascal / Diallo, Madiagne / Ferreira, Afonso et al. | 2003
- 81
-
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and GenerationBonichon, Nicolas / Gavoille, Cyril / Hanusse, Nicolas et al. | 2003
- 93
-
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph ClassesBonsma, Paul et al. | 2003
- 106
-
Tree Spanners for Bipartite Graphs and Probe Interval GraphsBrandstädt, Andreas / Dragan, Feodor F. / Le, Hoang-Oanh / Le, Van Bang / Uehara, Ryuhei et al. | 2003
- 119
-
A Simple Linear Time LexBFS Cograph Recognition AlgorithmBretscher, Anna / Corneil, Derek / Habib, Michel / Paul, Christophe et al. | 2003
- 131
-
Backbone Colorings for NetworksBroersma, Hajo / Fomin, Fedor V. / Golovach, Petr A. / Woeginger, Gerhard J. et al. | 2003
- 143
-
Greedy Edge-Disjoint Paths in Complete GraphsCarmi, Paz / Erlebach, Thomas / Okamoto, Yoshio et al. | 2003
- 156
-
Graph-Based Approaches to Software WatermarkingCollberg, Christian / Kobourov, Stephen / Carter, Edward / Thomborson, Clark et al. | 2003
- 168
-
Completely Connected Clustered GraphsCornelsen, Sabine / Wagner, Dorothea et al. | 2003
- 180
-
An FPT Algorithm for Set SplittingDehne, Frank / Fellows, Michael R. / Rosamond, Frances A. et al. | 2003
- 192
-
Drawing Planar Graphs on a CurveDi Giacomo, E. / Didimo, W. / Liotta, G. / Wismath, S. K. et al. | 2003
- 205
-
Tree-Partitions of k-Trees with Applications in Graph LayoutDujmović, Vida / Wood, David R. et al. | 2003
- 218
-
Resource Allocation Problems in Multifiber WDM Tree NetworksErlebach, Thomas / Pagourtzis, Aris / Potika, Katerina / Stefanakos, Stamatis et al. | 2003
- 230
-
An Improved Upper Bound on the Crossing Number of the HypercubeFaria, Luerbio / Figueiredo, Celina M. Herrera / Sýkora, Ondrej / Vrt’o, Imrich et al. | 2003
- 237
-
NCE Graph Grammars and Clique-WidthGlikson, Alexander / Makowsky, Johann A. et al. | 2003
- 249
-
Chordal Probe GraphsGolumbic, Martin Charles / Lipshteyn, Marina et al. | 2003
- 261
-
Subgraph Induced Planar Connectivity AugmentationGutwenger, Carsten / Jünger, Michael / Leipert, Sebastian / Mutzel, Petra / Percan, Merijam / Weiskircher, René et al. | 2003
- 273
-
On the Recognition of General Partition GraphsKloks, Ton / Lee, Chuan-Min / Liu, Jiping / Müller, Haiko et al. | 2003
- 284
-
Short Cycles in Planar GraphsKowalik, Łukasz et al. | 2003
- 297
-
Complexity of Hypergraph Coloring and Seidel’s SwitchingKratochvíl, Jan et al. | 2003
- 309
-
Feedback Vertex Set and Longest Induced Path on AT-Free GraphsKratsch, Dieter / Müller, Haiko / Todinca, Ioan et al. | 2003
- 322
-
The Complexity of Graph ContractionsLevin, Asaf / Paulusma, Daniël / Woeginger, Gerhard J. et al. | 2003
- 334
-
Tree Spanners, Cayley Graphs, and Diametrically Uniform GraphsManuel, Paul / Rajan, Bharati / Rajasingh, Indra / Alaguvel, Amutha et al. | 2003
- 346
-
The Probabilistic Minimum Coloring ProblemMurat, Cécile / Paschos, Vangelis Th. et al. | 2003
- 358
-
Recognizing Bipolarizable and P 4-Simplicial GraphsNikolopoulos, Stavros D. / Palios, Leonidas et al. | 2003
- 370
-
Coloring Powers of Graphs of Bounded Clique-WidthTodinca, Ioan et al. | 2003
- 383
-
Erratum: Cycles in Generalized NetworksBrandenburg, Franz J. et al. | 2003