Search Sciweavers | Sciweavers

401 search results - page 19 / 81

» Sparse Quasi-Random Graphs

click to vote

IPPS
1999
IEEE

119views Distributed And Parallel Com...» more IPPS 1999»

Sparse Hypercube: A Minimal k-Line Broadcast Graph

15 years 1 months ago

Download ipdps.cc.gatech.edu

This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...

Satoshi Fujita, Arthur M. Farley

claim paper

Read More »

101

Voted

DM
2010

78views more DM 2010»

Injective colorings of sparse graphs

14 years 9 months ago

Download www.people.vcu.edu

Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu

claim paper

Read More »

click to vote

ICALP
2004
Springer

112views Programming Languages» more ICALP 2004»

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs

15 years 2 months ago