Search Sciweavers | Sciweavers

4009 search results - page 83 / 802

» Clustering on Complex Graphs

Voted

ICALP
2010
Springer

104views Programming Languages» more ICALP 2010»

Graph Homomorphisms with Complex Values: A Dichotomy Theorem

15 years 8 months ago

Download pages.cs.wisc.edu

Jin-yi Cai, Xi Chen, Pinyan Lu

claim paper

Read More »

107

click to vote

COCO
2001
Springer

101views Algorithms» more COCO 2001»

Resolution Complexity of Independent Sets in Random Graphs

15 years 8 months ago

Download www.cs.cornell.edu

Paul Beame, Russell Impagliazzo, Ashish Sabharwal

claim paper

Read More »

116

Voted

ICALP
2001
Springer

86views Programming Languages» more ICALP 2001»

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

15 years 8 months ago

Download theinf1.informatik.uni-jena.de

Jochen Alber, Henning Fernau, Rolf Niedermeier

claim paper

Read More »

Voted

COCOON
1999
Springer

109views Combinatorics» more COCOON 1999»

On the Complexity of Approximating Colored-Graph Problems

15 years 7 months ago

Download www.mat.uniroma2.it

Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...

claim paper

Read More »

131

Voted

WG
1994
Springer

131views Theoretical Computer Science» more WG 1994»

Complexity of Graph Covering Problems

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers