33 search results - page 2 / 7 » Optimal Edge Deletions for Signed Graph Balancing |
113
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
115
click to vote
JCO
2010
15 years 5 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
118
click to vote
BIRTHDAY
2008
Springer
15 years 3 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
131
click to vote
ASPDAC
2001
ACM
15 years 5 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
139
click to vote
KDD
2012
ACM
13 years 4 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...