Sciweavers

19 search results - page 4 / 4
» Layered Drawings of Graphs with Crossing Constraints
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
13 years 2 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
GD
2006
Springer
13 years 9 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
BMCBI
2010
143views more  BMCBI 2010»
13 years 5 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
INFOCOM
2008
IEEE
13 years 11 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...