Sciweavers

704 search results - page 2 / 141
» Isometrically Embedded Graphs
Sort
View
DM
2008
92views more  DM 2008»
13 years 7 months ago
Partial cubes: structures, characterizations, and constructions
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi
Sergei Ovchinnikov
DM
2007
98views more  DM 2007»
13 years 6 months ago
Fast recognition of classes of almost-median graphs
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Pe...
DM
2002
97views more  DM 2002»
13 years 6 months ago
Resonance graphs of catacondensed even ring systems are median
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
Sandi Klavzar, Petra Zigert, Gunnar Brinkmann
CPC
2007
76views more  CPC 2007»
13 years 6 months ago
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Pet...
GBRPR
2009
Springer
14 years 1 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...