Graphical evolution: an introduction to the theory of random graphs
Graphical evolution: an introduction to the theory of random graphs
Discrete Applied Mathematics
Journal of Information Processing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Theoretical Computer Science
Proceedings of the 1997 international symposium on Physical design
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A new lower bound for the bipartite crossing number with applications
Theoretical Computer Science
Proceedings of the conference on Design, automation and test in Europe
A universal client for distributed networked design and computing
Proceedings of the 38th annual Design Automation Conference
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
On Bipartite Drawings and the Linear Arrangement Problem
SIAM Journal on Computing
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
VPR: A new packing, placement and routing tool for FPGA research
FPL '97 Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Generation of tightly controlled equivalence classes for experimental design of heuristics for graph-based np-hard problems
An approximation algorithm for the two-layered graph drawing problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The crossing distribution problem [IC layout]
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers
Annals of Mathematics and Artificial Intelligence
High-contrast algorithm behavior: observation, hypothesis, and experimental design
Proceedings of the 2007 workshop on Experimental computer science
High-contrast algorithm behavior: observation, conjecture, and experimental design
ecs'07 Experimental computer science on Experimental computer science
Crossing minimization in weighted bipartite graphs
Journal of Discrete Algorithms
Crossing minimization in weighted bipartite graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A solution to bipartite drawing problem using genetic algorithm
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
The bigraph crossing problem, embedding the two node sets of a bipartite graph along two parallel lines so that edge crossings are minimized, has applications to circuit layout and graph drawing. Experimental results for several previously known and two new heuristics suggest continued exploration of the problem, particularly sparse instances. We emphasize careful design of experimental subject classes and present novel views of the results. All source code, data, and scripts are available on-line