23. WG 1997: Berlin, Germany
Rolf H. Möhring (Ed.): Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings. Springer 1997 Lecture Notes in Computer Science ISBN 3-540-63757-5- David P. Williamson: Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). 1
- Paola Alimonti: Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. 2-14
- Luitpold Babel, Stephan Olariu: On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). 25-37
- Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). 52-64
- Alberto Bertoni, Paola Campadelli, Roberto Posenato: An Upper Bound for the Maximum Cut Mean Value. 78-84
- Stephan Brandt: Computing the Independence Number of Dense Triangle-Free Graphs. 100-108
- Hajo Broersma, Elias Dahlhaus, Ton Kloks: Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. 109-117
- Christian Capelle: Block Decomposition of Inheritance Hierarchies. 118-131
- Elias Dahlhaus: Minimal Elimination Ordering Inside a Given Chordal Graph. 132-143
- Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks: On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. 171-183
- Feodor F. Dragan: On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). 184-198
- Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Colored Graph Covers I. Colored Directed Multigraphs. 242-257
- Erich Prisner: Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. 273-287
- Michael Sampels: Large Networks with Small Diameter. 288-302
- Konstantin Skodinis: The Bounded Tree-Width Problem of Context-Free Graph Languages. 303-317
- Mikkel Thorup: Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). 318-332
- Ryuhei Uehara: A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. 333-341
- Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi: Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. 354-367
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team