2294 search results - page 205 / 459 » From Path Graphs to Directed Path Graphs |
115
click to vote
SODA
2010
ACM
16 years 7 days ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
108
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
112
click to vote
JGAA
2000
15 years 2 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
105
click to vote
IJCAI
2007
15 years 4 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
141
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...