Sciweavers

199 search results - page 4 / 40

» Recognizing HHDS-Free Graphs

20

HICSS
2009
IEEE

122views Biometrics» more HICSS 2009»

Towards an Optimal Algorithm for Recognizing Laman Graphs

14 years 4 months ago

Towards an Optimal Algorithm for Recognizing Laman Graphs

Download www.cs.brown.edu

Ovidiu Daescu, Anastasia Kurdia

claim paper

Read More »

36

SHAPE
1999
Springer

122views Computer Vision» more SHAPE 1999»

Recognizing Objects Using Color-Annotated Adjacency Graphs

14 years 2 months ago

Recognizing Objects Using Color-Annotated Adjacency Graphs

Download users.cecs.anu.edu.au

Peter Henry Tu, Tushar Saxena, Richard I. Hartley

claim paper

Read More »

17

DMTCS
2006

75views Mathematics» more DMTCS 2006»

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs

13 years 9 months ago

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs

Download www.dmtcs.org

Stavros D. Nikolopoulos, Leonidas Palios

claim paper

Read More »

21

JGT
2010

82views more JGT 2010»

On recognizing graphs by numbers of homomorphisms

13 years 8 months ago

On recognizing graphs by numbers of homomorphisms

Download iti.mff.cuni.cz

Zdenek Dvorak

claim paper

Read More »

25

MFCS
2007
Springer

109views Theoretical Computer Science» more MFCS 2007»

On the Complexity of Computing Treelength

14 years 3 months ago

On the Complexity of Computing Treelength

Download www.ii.uib.no

We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...

Daniel Lokshtanov

claim paper

Read More »

« Prev « First page 4 / 40 Last » Next »