31 search results - page 2 / 7 » Strict Betweennesses Induced by Posets as well as by Graphs |
111
click to vote
WG
1998
Springer
15 years 5 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
119
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
128
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
APPML
2007
15 years 1 months ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
113
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...