Sciweavers

3757 search results - page 98 / 752
» The overlap number of a graph
Sort
View
DM
2002
107views more  DM 2002»
14 years 9 months ago
Edge clique graphs and some classes of chordal graphs
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
Márcia R. Cerioli, Jayme Luiz Szwarcfiter
BIBE
2008
IEEE
121views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Joining retinal vessel segments
—A new method is introduced for joining vessel segments together to form a vessel graph. Using a reference image set from the Sunderland Eye Infirmary, we analysed the retinal b...
Bashir Al-Diri, Andrew Hunter, David Steel, Maged ...
GD
2006
Springer
15 years 1 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
ARSCOM
2006
140views more  ARSCOM 2006»
14 years 10 months ago
Expansion Properties Of Levi Graphs
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...
ARSCOM
2005
94views more  ARSCOM 2005»
14 years 9 months ago
Isometrically Embedded Graphs
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
Debra L. Boutin