Search Sciweavers | Sciweavers

882 search results - page 28 / 177

» On the Hardness of Graph Isomorphism

141

click to vote

ESA
2006
Springer

137views Algorithms» more ESA 2006»

Deciding Relaxed Two-Colorability - A Hardness Jump

15 years 9 months ago

Download www.inf.ethz.ch

A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...

Robert Berke, Tibor Szabó

claim paper

Read More »

131

click to vote

WG
2009
Springer

81views Theoretical Computer Science» more WG 2009»

Hardness Results and Efficient Algorithms for Graph Powers

15 years 10 months ago

Download www.lirmm.fr

Van Bang Le, Nguyen Ngoc Tuy

claim paper

Read More »

click to vote

AAAI
2008

100views Intelligent Agents» more AAAI 2008»

Generating Hard SAT/CSP Instances Using Expander Graphs

15 years 8 months ago

Download www.aaai.org

Carlos Ansótegui, Ramón Béjar...

claim paper

Read More »

164

click to vote

CPM
2008
Springer

170views Combinatorics» more CPM 2008»

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

15 years 7 months ago

Download www.cs.ucr.edu

Nadja Betzler, Michael R. Fellows, Christian Komus...

claim paper

Read More »

152

click to vote

FOCS
2010
IEEE

140views Theoretical Computer Science» more FOCS 2010»

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

15 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers