combinatorics | Sciweavers

18

COCOON
1999
Springer

156views Combinatorics» more COCOON 1999»

An External Memory Data Structure for Shortest Path Queries

13 years 9 months ago

We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...

David A. Hutchinson, Anil Maheshwari, Norbert Zeh

claim paper

Read More »

10

click to vote

COCOON
1999
Springer

101views Combinatorics» more COCOON 1999»

The Web as a Graph: Measurements, Models, and Methods

13 years 9 months ago

Download www.cs.brown.edu

Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, ...

claim paper

Read More »

9

click to vote

COCOON
1999
Springer

101views Combinatorics» more COCOON 1999»

Multi-coloring Trees

13 years 9 months ago

Download www.ii.uib.no

Scheduling jobs with pairwise conﬂicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...

Magnús M. Halldórsson, Guy Kortsarz,...

claim paper

Read More »

10

click to vote

COCOON
1999
Springer

96views Combinatorics» more COCOON 1999»

Distributionally-Hard Languages

13 years 9 months ago

Download www.cs.iastate.edu

Cai and Selman [CS99] deﬁned a modiﬁcation of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...

Lance Fortnow, Aduri Pavan, Alan L. Selman

claim paper

Read More »

12

click to vote

COCOON
1999
Springer

101views Combinatorics» more COCOON 1999»

Layout Problems on Lattice Graphs

13 years 9 months ago

Download www.lsi.upc.es

Josep Díaz, Mathew D. Penrose, Jordi Petit,...

claim paper

Read More »

12

click to vote

COCOON
1999
Springer

117views Combinatorics» more COCOON 1999»

GCD of Many Integers

13 years 9 months ago

Download www.ccs.neu.edu

Gene Cooperman, Sandra Feisel, Joachim von zur Gat...

claim paper

Read More »

11

click to vote

COCOON
1999
Springer

109views Combinatorics» more COCOON 1999»

On the Complexity of Approximating Colored-Graph Problems

13 years 9 months ago

Download www.mat.uniroma2.it

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

claim paper

Read More »

13

click to vote

COCOON
1999
Springer

142views Combinatorics» more COCOON 1999»

On Routing in Circulant Graphs

13 years 9 months ago

Download www.cs.ust.hk

We investigate various problems related to circulant graphs – ﬁnding the shortest path between two vertices, ﬁnding the shortest loop, and computing the diameter. These probl...

Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...

claim paper

Read More »

9

click to vote

COCOON
1999
Springer

131views Combinatorics» more COCOON 1999»

On Bounds for the k-Partitioning of Graphs

13 years 9 months ago

Download mcs.uwsuper.edu

Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete...

claim paper