Name
Abstract | ||
|---|---|---|
The bigraph crossing problem, embedding the two vertex sets of a bipartite graph G = (V0, V1, E) along two parallel lines so that edge crossings are minimized, has application to circuit layout and graph drawing. We consider the case where both V0 and V1 can be permuted arbitrarily -- both this and the case where the order of one vertex set is fixed are NP-hard. Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented. The new heuristics outperform existing heuristics on graph classes that range from application-specific to random. Our experimental design methodology ensures that differences in performance are statistically significant and not the result of minor variations in graph structure or input order. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-48518-X_5 | ALENEX |
Keywords | Field | DocType |
crossing number,experimental design,bipartite graph | Discrete mathematics,Combinatorics,Bigraph,Circulant graph,Line graph,Crossing number (graph theory),Vertex (graph theory),Graph embedding,Computer science,Algorithm,Cycle graph,Feedback vertex set | Conference |
Volume | ISSN | ISBN |
1619 | 0302-9743 | 3-540-66227-8 |
Citations | PageRank | References |
6 | 0.55 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias F. M. Stallmann | 1 | 166 | 19.38 |
| Franc Brglez | 2 | 525 | 80.13 |
| Debabrata Ghosh | 3 | 7 | 2.04 |