Sciweavers

296 search results - page 24 / 60
» Group connectivity of certain graphs
Sort
View
IPMU
2010
Springer
13 years 9 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 2 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
WSDM
2010
ACM
214views Data Mining» more  WSDM 2010»
14 years 5 months ago
You are who you know: Inferring user profiles in Online Social Networks
Online social networks are now a popular way for users to connect, express themselves, and share content. Users in today's online social networks often post a profile, consis...
Alan Mislove, Bimal Viswanath, P. Krishna Gummadi,...
JGAA
2006
127views more  JGAA 2006»
13 years 7 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 9 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...