2612 search results - page 221 / 523 » Switching Graphs and Their Complexity |
141
click to vote
GD
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
158
click to vote
BIOINFORMATICS
2007
15 years 6 months ago
2007
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
153
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
134
click to vote
JGT
2007
15 years 5 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
159
click to vote
CORR
2011
Springer
15 years 25 days ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...