Sciweavers

5889 search results - page 71 / 1178
» Graph Layout Problems
Sort
View
GD
2008
Springer
13 years 11 months ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 9 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
ICDAR
2003
IEEE
14 years 3 months ago
Graph Grammar Based Analysis System of Complex Table Form Document
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
Akira Amano, Naoki Asada
JGAA
2007
87views more  JGAA 2007»
13 years 10 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
DAM
2007
94views more  DAM 2007»
13 years 10 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...