Graph-Theoretic Concepts in Computer Science 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers /
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The pap...
Clasificación: | Libro Electrónico |
---|---|
Autor Corporativo: | |
Otros Autores: | , , , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
Edición: | 1st ed. 2012. |
Colección: | Theoretical Computer Science and General Issues,
7551 |
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- Account on Intervals
- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance
- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture
- Triangulation and Clique Separator Decomposition of Claw-Free Graphs
- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
- The Duals of Upward Planar Graphs on Cylinders
- On the Minimum Degree Up to Local Complementation: Bounds and Complexity
- Bisections above Tight Lower Bounds
- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
- Hydras: Directed Hypergraphs and Horn Formulas
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs
- Parameterized Domination in Circle Graphs
- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties.