Search Sciweavers | Sciweavers

9532 search results - page 52 / 1907

» Logic, Graphs, and Algorithms

143

click to vote

SIAMDM
2010

136views more SIAMDM 2010»

Obnoxious Centers in Graphs

14 years 10 months ago

Download www.fmf.uni-lj.si

We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...

Sergio Cabello, Günter Rote

claim paper

Read More »

101

click to vote

SWAT
2000
Springer

98views Algorithms» more SWAT 2000»

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph

15 years 7 months ago

Download www.orsj.or.jp

Toshimasa Ishii, Hiroshi Nagamochi

claim paper

Read More »

113

click to vote

STOC
2007
ACM

92views Algorithms» more STOC 2007»

Terminal backup, 3D matching, and covering cubic graphs

16 years 4 months ago

Download www.cs.rpi.edu

Elliot Anshelevich, Adriana Karagiozova

claim paper

Read More »

105

click to vote

STOC
2006
ACM

122views Algorithms» more STOC 2006»

Hardness of cut problems in directed graphs

16 years 4 months ago

Download www.cis.upenn.edu

Julia Chuzhoy, Sanjeev Khanna

claim paper

Read More »

133

click to vote

STOC
2002
ACM

95views Algorithms» more STOC 2002»

Crawling on web graphs

16 years 4 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers