141 search results - page 2 / 29 » Layout Problems on Lattice Graphs |
SIAMDM
2008
13 years 5 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
DM
2002
13 years 5 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
MVA
1996
13 years 6 months ago
1996
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...
AICCSA
2005
IEEE
13 years 11 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
CLA
2007
13 years 6 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...