983 search results - page 102 / 197 » Negative-Weight Cycle Algorithms |
120
Voted
RSA
2002
15 years 2 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
93
Voted
JCT
2011
14 years 9 months ago
2011
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
127
Voted
IMC
2010
ACM
15 years 15 days ago
2010
ACM
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...
141
Voted
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
100
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— We consider the problem of minimizing the resources used for network coding while achieving the desired throughput in a multicast scenario. Since this problem is NPhard...