223 search results - page 37 / 45 » On Computing Longest Paths in Small Graph Classes |
RECOMB
2007
Springer
14 years 7 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
SPAA
2003
ACM
14 years 18 days ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant ...
STACS
1997
Springer
13 years 11 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...