Sciweavers

1952 search results - page 34 / 391

» Complete partitions of graphs

120

ISTCS
1997
Springer

220views Applied Computing» more ISTCS 1997»

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

15 years 7 months ago

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

Download www.lifl.fr

Vladimir Grebinski, Gregory Kucherov

claim paper

Read More »

126

Voted

ICIAR
2010
Springer

142views Image Analysis» more ICIAR 2010»

The Proof of Completeness of the Graph Method for Generation of Affine Moment Invariants

15 years 6 months ago

The Proof of Completeness of the Graph Method for Generation of Affine Moment Invariants

Download library.utia.cas.cz

Tomás Suk

claim paper

Read More »

104

Voted

ICSOFT
2008

145views Software Engineering» more ICSOFT 2008»

Using Bitstream Segment Graphs for Complete Description of Data Format Instances

15 years 5 months ago

Using Bitstream Segment Graphs for Complete Description of Data Format Instances

Download www.ifs.tuwien.ac.at

Michael Hartle, Friedrich-Daniel Möller, Slav...

claim paper

Read More »

120

Voted

CPC
2008

114views more CPC 2008»

Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles

15 years 4 months ago

Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles

Download www.cdam.lse.ac.uk

In 1998 Luczak, R

Peter Allen

claim paper

Read More »

119

Voted

CPC
2008

63views more CPC 2008»

The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

15 years 4 months ago

The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

Download www.nas.its.tudelft.nl

Gerard Hooghiemstra, Piet Van Mieghem

claim paper

Read More »

« Prev « First page 34 / 391 Last » Next »