Filters








26 Hits in 2.8 sec

Biclique Edge Cover Graphs and Confluent Drawings [chapter]

Michael Hirsch, Henk Meijer, David Rappaport
Graph Drawing  
Contribution Power Set = {Ø, {b 0 }, {b 1 }, {c 0 }, {b 0 , b 1 }, {b 0 , c 0 }, {b 1 , c 0 }, {b 0 , b 1 b and b j w b such that (b i , b j ) B  ... 
doi:10.1007/978-3-540-70904-6_39 dblp:conf/gd/HirschMR06 fatcat:t5mde2ulbrc4pmg2xws2v3yyx4

Confluent Layered Drawings

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2007 Algorithmica  
The biclique cover problem is reduced to a special edge coloring problem and solved by heuristic coloring algorithms. Our method can be extended to obtain multi-depth confluent layered drawings.  ...  We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings.  ...  Particularly, in the resultant confluent drawing, we replace bicliques in a biclique cover of a twolayer graph G = (U, L, E) by tree-like structures and draw them with smooth curves.  ... 
doi:10.1007/s00453-006-0159-8 fatcat:2bdu4vytcrh6thzc6adzp2gz4u

Confluent Layered Drawings [chapter]

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005 Lecture Notes in Computer Science  
The biclique cover problem is reduced to a special edge coloring problem and solved by heuristic coloring algorithms. Our method can be extended to obtain multi-depth confluent layered drawings.  ...  We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings.  ...  Particularly, in the resultant confluent drawing, we replace bicliques in a biclique cover of a twolayer graph G = (U, L, E) by tree-like structures and draw them with smooth curves.  ... 
doi:10.1007/978-3-540-31843-9_20 fatcat:b3sh32g5w5eotnjfo747jey5fe

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [chapter]

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2004 Lecture Notes in Computer Science  
Producing such confluent drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed  ...  We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way.  ...  Acknowledgments We would like to thank Jie Ren and André van der Hoek for supplying us with several examples of graphs used in software visualization.  ... 
doi:10.1007/978-3-540-24595-7_1 fatcat:5xkk3immgffmta45m6rpmalb7y

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [article]

Matthew Dickerson and David Eppstein and Michael T. Goodrich and Jeremy Meng
2002 arXiv   pre-print
The main idea of this approach is quite simple: we allow groups of edges to be merged together and drawn as "tracks" (similar to train tracks).  ...  Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams in a planar way.  ...  Acknowledgments We would like to thank Jie Ren and André van der Hoek for supplying us with several examples of graphs used in software visualization.  ... 
arXiv:cs/0212046v1 fatcat:ddd3siotgrhddkypysi4fy7wjy

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Y. Meng
2005 Journal of Graph Algorithms and Applications  
Producing such confluent drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed  ...  We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way.  ...  Acknowledgments We would like to thank Jie Ren and André van der Hoek for supplying us with several examples of graphs used in software visualization.  ... 
doi:10.7155/jgaa.00099 fatcat:orii7er2krhzjdphrgq5a3ttre

Graph Drawing Contest Report [chapter]

Franz J. Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks
2004 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/978-3-540-24595-7_52 fatcat:aif4tqhewbhxpl32yp36xqtx2i

Graph-drawing contest report [chapter]

Peter Eades, Joe Marks, Stephen North
1997 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/3-540-63938-1_88 fatcat:n72tcplezfeare6wv6ugfbaxbq

Graph-Drawing Contest Report [chapter]

Franz J. Brandenburg, Christian A. Duncan, Emden Gansner, Stephen G. Kobourov
2005 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/978-3-540-31843-9_56 fatcat:gq3t6l7u2jb7vegfwkuckuphma

Graph-Drawing Contest Report [chapter]

Peter Eades, Joe Marks, Petra Mutzel, Stephen North
1998 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/3-540-37623-2_34 fatcat:i4lravfqqjaydmtebufjoixyc4

Graph-Drawing Contest Report [chapter]

Franz J. Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
1999 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/3-540-46648-7_41 fatcat:hq3dal4keram7jrkmek7y3jnue

Graph-Drawing contest report [chapter]

Peter Eades, Joe Marks, Stephen North
1997 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/3-540-62495-3_43 fatcat:wkqp7hraavat3a7uflg2nqifsi

Graph-drawing contest report [chapter]

Peter Eades, Joe Marks
1995 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/3-540-58950-3_365 fatcat:bwh33mzywnf3fpbowkvzoyr2dy

Graph-Drawing contest report [chapter]

Peter Eades, Joe Marks
1996 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/bfb0021806 fatcat:pnimg55rqfg77ainoexyk7i2ci

Graph-Drawing Contest Report [chapter]

Franz Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner
2001 Lecture Notes in Computer Science  
The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.  ...  This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy.  ...  The 2003 Graph Drawing Contest has been sponsered by AT&T Research Laboratories, Murray Hill, MERL Mitsubishi Electric Research Laboratories, Cambridge, and Tom Sawyer Software, Oakland.  ... 
doi:10.1007/3-540-44541-2_39 fatcat:kpscprnpffaaphlfencafb4myq
« Previous Showing results 1 — 15 out of 26 results