Sciweavers

1101 search results - page 24 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
GD
2005
Springer
14 years 2 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
MFCS
2009
Springer
14 years 3 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
PAMI
1998
107views more  PAMI 1998»
13 years 8 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 16 days ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
SIES
2007
IEEE
14 years 2 months ago
Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
Bastian Knerr, Martin Holzer 0002, Markus Rupp