Nantilus
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...
Enregistré dans:
| Auteurs principaux : | , , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Graph-Theoretic Concepts in Computer Science : 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers / edited by Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2012 Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Sujets : | |
| Documents associés : | Autre format:
Graph-Theoretic Concepts in Computer Science Autre format: Graph-Theoretic Concepts in Computer Science |
- 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.