Sciweavers

488 search results - page 61 / 98
» Automorphic Decompositions of Graphs
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
WG
2010
Springer
13 years 6 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
CVPR
2008
IEEE
14 years 9 months ago
From skeletons to bone graphs: Medial abstraction for object recognition
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
Diego Macrini, Kaleem Siddiqi, Sven J. Dickinson
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
14 years 1 months ago
Collective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
SIAMDM
1998
95views more  SIAMDM 1998»
13 years 7 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd