983 search results - page 3 / 197 » Negative-Weight Cycle Algorithms |
90
Voted
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
COMBINATORICS
2000
14 years 9 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
106
click to vote
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
GD
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
100
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...