Sciweavers

3471 search results - page 120 / 695
» Obstacle Numbers of Graphs
Sort
View
WG
2010
Springer
13 years 8 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
DM
2007
113views more  DM 2007»
13 years 9 months ago
Counting labeled general cubic graphs
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
ADHOCNOW
2008
Springer
14 years 4 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 2 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
14 years 2 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger