Graph Theoretic Concepts in Computer Science 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers /
The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japa...
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2010.
|
| Σειρά: | Lecture Notes in Computer Science,
6410 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Invited Talks
- Algorithmic Barriers from Phase Transitions in Graphs
- Algorithmic Graph Minors and Bidimensionality
- Regular Talks
- Complexity Results for the Spanning Tree Congestion Problem
- max-cut and Containment Relations in Graphs
- The Longest Path Problem is Polynomial on Cocomparability Graphs
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
- On Stable Matchings and Flows
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
- Efficient Algorithms for Eulerian Extension
- On the Small Cycle Transversal of Planar Graphs
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
- Graphs that Admit Right Angle Crossing Drawings
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
- On the Boolean-Width of a Graph: Structure and Applications
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
- Colouring Vertices of Triangle-Free Graphs
- A Quartic Kernel for Pathwidth-One Vertex Deletion
- Network Exploration by Silent and Oblivious Robots
- Uniform Sampling of Digraphs with a Fixed Degree Sequence
- Measuring Indifference: Unit Interval Vertex Deletion
- Parameterized Complexity of the Arc-Preserving Subsequence Problem
- From Path Graphs to Directed Path Graphs
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Efficient Broadcasting in Random Power Law Networks
- Graphs with Large Obstacle Numbers
- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree
- The Number of Bits Needed to Represent a Unit Disk Graph
- Lattices and Maximum Flow Algorithms in Planar Graphs.
