22 search results - page 2 / 5 » Two disjoint negative cycles in a signed graph |
84
Voted
PAKDD
2010
ACM
15 years 4 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
JACM
2007
14 years 11 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
114
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
DM
2010
14 years 9 months ago
2010
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
DM
2010
14 years 6 months ago
2010
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...