Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization

Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization

Cached

Download Links

by Matthias Stallmann , Franc Brglez , Debabrata Ghosh

Citations:

BibTeX

@MISC{Stallmann_heuristics,experimental,
    author = {Matthias Stallmann and Franc Brglez and Debabrata Ghosh},
    title = {Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization },
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

864	An Efficient Heuristic Procedure for Partitioning Graphs - Kernighan, Lin - 1970
615	Introduction to Graph Theory - West - 2001
593	LEDA: A Platform for Combinatorial and Geometric Computing. MaxPlanck-Institut fuer Informatik, Saarbruecken - Mehlhorn, Naeher - 1995
314	How to draw a graph - Tutte - 1962
283	Graph Drawing – Algorithms for the Visualization of Graphs - Battista, Eades, et al. - 1999
210	VPR: A new packing, placement and routing tool for FPGA research - Betz, Rose - 1997
200	A technique for drawing directed graphs - Gansner, Koutsofios, et al. - 1993
186	Crossing number is np-complete - Garey, Johnson - 1983
83	How to draw a directed graph - Eades, Sugiyama - 1990
82	Area-time complexity for VLSI - Thompson - 1979
76	New lower bound techniques for VLSI - Leighton - 1984
76	Convex representation of graphs - Tutte - 1960
62	Graphical Evolution: An Introduction to the Theory of Random Graphs - Palmer - 1985
53	P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms - Jünger, Mutzel - 1997
46	Bipartite permutation graphs - Spinrad, Brandstädt, et al. - 1987
43	Crossing theory and hierarchy mapping - Warfield - 1977
36	The Stanford GraphBase - Knuth - 1994
31	Heuristics for reducing crossings in 2-layered networks - Eades, Kelly - 1986
28	S.: Drawing graphs in two layers - Eades, Whitesides - 1994
27	N.: On an edge crossing problem - Eades, McKay, et al. - 1986
27	Synthesis of Wiring Signature-Invariant Equivalence Class Circuit Mutants and Applications to Benchmarking - Ghosh, Kapur, et al. - 1998
25	A minimum linear arrangement algorithm for undirected trees - Shiloach - 1979
24	Using sifting for k-layer straightline crossing minimization - MATUSZEWSKI, SCHÖNFELD, et al. - 1999
22	Tutte, Convex Representations of Graphs - T - 1960
18	Towards a new benchmarking paradigm in EDA: analysis of 39 equivalence class mutant circuit distributions, in - Kapur, Ghosh, et al. - 1997
15	Experiments on drawing 2-level hierarchical graphs - Mäkinen - 1990
14	On bipartite drawings and the linear arrangement problem - Shahrokhi, S´ykora, et al.
13	Heuristics and Experimental Design for Bigraph Crossing Number Minimization - Stallmann, Brglez, et al. - 1999
12	A Library of Algorithms for Graph Drawing - Mutzel, Gutwengwer, et al. - 1998
11	Generation of Tightly Controlled Equivalence Classes for Experimental Design of Heuristics for Graph-Based NP-hard Problems - Ghosh - 2000
10	The Crossing Distribution Problem - Marek-Sadowska, Sarrafzadeh - 1995
7	Equivalence classes of circuit mutants for experimental design - Ghosh, Brglez - 1999
6	OpenExperiment: A Configurable Environment for Collaborative Experimental - Brglez, Lavana, et al. - 2000
5	OASIS2.0 User's Guide. MCNC, Research Triangle - Kozminski - 1992
5	Cell Placement and Minimization of Crossing Numbers - Kapur - 1998
4	A Universal Client for Distributed Networked Design and Computing - BRGLEZ, LAVANA - 2001
4	Characterization of level non-planar graphs by minimal patterns - HEALY, KUUSIK, et al. - 2000
4	A note on the median heuristic for drawing bipartite graphs - Mäkinen - 1989
4	Evaluating Iterative Improvement Heuristics for Bigraph Crossing Minimization - Stallmann, Brglez, et al. - 1999
4	to draw a graph, Proc - How - 1963
3	Hypercrossing Number: A New and Effective Cost Function for Cell Placement Optimization - Ghosh, Brglez, et al. - 1998
3	A new Lower bound for the bipartite crossing number with algorithmic applications, submitted for publication - Shahrokhi, S'ykora, et al.
3	Trees with Hamiltonian - Harary, Schwenk - 1971
2	First steps towards experimental design in evaluating layout algorithms: Wire length versus wire crossing in linear placement optimization - Ghosh, Brglez, et al. - 1998
2	Trees with hamiltonian square, Mathematika 18 - Harary, Schwenk - 1971
1	On optimal linear arrangement of trees. Comp. and Maths. with Appls - Chung - 1984
1	Drawing graphs in two layers. Theoretical Computer 40 - Stallmann, Brglez, et al. - 1994
1	Bigraph Crossing Minimization · 41 - Marek-Sadowska, Sarrafzadeh - 1995
1	The AGD-Library: Algorithms for Graph Drawing. Available from http://www.mpi-sb.mpg.de/~mutzel/dfgdraw/agdlib.html - Mutzel - 1998
1	K-layer straightline crossing minimization by soeeding up sifting - Schönfeld, Günter, et al. - 2000