1201 search results - page 60 / 241 » Linear Probing and Graphs |
107
Voted
ALGORITHMICA
2002
15 years 13 days ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
107
click to vote
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
131
click to vote
BIBM
2009
IEEE
15 years 7 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
103
Voted
WAW
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
103
Voted
DAM
2008
15 years 19 days ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...