Sciweavers

3471 search results - page 128 / 695
» Obstacle Numbers of Graphs
Sort
View
APVIS
2008
13 years 11 months ago
Crossing Minimization meets Simultaneous Drawing
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
Markus Chimani, Michael Jünger, Michael Schul...
PODC
2006
ACM
14 years 3 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
ACSC
2004
IEEE
14 years 1 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber
JBI
2004
163views Bioinformatics» more  JBI 2004»
13 years 11 months ago
Artificial Chemistries and Metabolic Pathways
Metabolism can be regarded as a network of biochemical reactions, connected via their substrates and products. A metabolic pathway is thus a coordinated series of reactions, and i...
Liliana Félix, Francesc Rosselló, Ga...
DM
1999
145views more  DM 1999»
13 years 9 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad