E-Books durchsuchen

Graph-Theoretic Concepts in Computer Science [2008]

1
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
14
Memory Efficient Anonymous Graph Exploration
30
Algorithmic Meta Theorems
31
A Most General Edge Elimination Polynomial
43
Approximating the Metric TSP in Linear Time
55
The Valve Location Problem in Simple Network Topologies
66
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
78
On the Pseudo-achromatic Number Problem
90
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
101
Faster Exact Bandwidth
110
Additive Spanners for Circle Graphs and Polygonal Graphs
122
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
134
Complexity of the Packing Coloring Problem for Trees
146
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
159
A Lower Bound on the Area Requirements of Series-Parallel Graphs
171
On Independent Sets and Bicliques in Graphs
183
Evaluations of Graph Polynomials
195
Parameterized Complexity for Domination Problems on Degenerate Graphs
206
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
218
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
230
The Rank-Width of the Square Grid
240
Improved Upper Bounds for Partial Vertex Cover
252
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
264
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
275
What Is between Chordal and Weakly Chordal Graphs?
287
Parameterized Graph Cleaning Problems
300
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
312
Fast Robber in Planar Graphs
324
From a Circular-Arc Model to a Proper Circular-Arc Model
336
Digraph Decompositions and Monotonicity in Digraph Searching
348
Searching for a Visible, Lazy Fugitive
360
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
372
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
Feedback