scientific article; zbMATH DE number 1974130

MaRDI QIDQ4422291zbMATH OpenFDO

Authors Matthew C. Newton, Ondrej Sýkora, Imrich Vrt'o

Publication date 3 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280312.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• New bounds on the barycenter heuristic for bipartite graph drawing.
• scientific article; zbMATH DE number 4128387
• Two-layer drawings of bipartite graphs
• On drawing regular bipartite graphs
• An efficient graph planarization two‐phase heuristic
• scientific article; zbMATH DE number 1054930
• Incremental bipartite drawing problem
• scientific article; zbMATH DE number 666305
• scientific article; zbMATH DE number 3963860
• A better heuristic for orthogonal graph drawings

Cited in

(14)

• Edge crossings in drawings of bipartite graphs
• New bounds on the barycenter heuristic for bipartite graph drawing.
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Semi-bipartite graph visualization for gene ontology networks
• On drawing regular bipartite graphs
• scientific article; zbMATH DE number 4128387 (Why is no real title available?)
• scientific article; zbMATH DE number 1054930 (Why is no real title available?)
• scientific article; zbMATH DE number 1512079 (Why is no real title available?)
• Genetic algorithms for drawing bipartite graphs
• Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization
• Graph Drawing
• Experiments on drawing 2-level hierarchical graphs
• Experiments on drawing 2-level hierarchical graphs
• Latent semantic analysis and Fiedler retrieval

Describes a project that uses

Uses Software

• GraphBase
• MatrixMarket

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422291)