Sciweavers

3265 search results - page 95 / 653
» Representing Groups on Graphs
Sort
View
IM
2006
15 years 3 months ago
Using PageRank to Characterize Web Structure
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...
Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
15 years 5 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
PLDI
2004
ACM
15 years 9 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
IPCO
2001
117views Optimization» more  IPCO 2001»
15 years 5 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 4 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson