356 search results - page 45 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
115
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht a...
105
click to vote
DM
2008
15 years 16 days ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
96
Voted
SIGIR
2008
ACM
15 years 11 days ago
2008
ACM
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
123
click to vote
DC
2002
15 years 8 days ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...