Sciweavers

3757 search results - page 233 / 752
» The overlap number of a graph
Sort
View
DAGSTUHL
2000
15 years 8 months ago
Presenting Data from Experiments in Algorithmics
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
Peter Sanders
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 6 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela
DAM
2006
73views more  DAM 2006»
15 years 6 months ago
Construction of sports schedules with multiple venues
A graph theoretical model is presented for constructing calendars for sports leagues where balancing requirement have to be considered with respect to the different venues where c...
Dominique de Werra, Tinaz Ekim, C. Raess
JCT
2008
85views more  JCT 2008»
15 years 6 months ago
Smith normal form and Laplacians
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
Dino J. Lorenzini
COMAD
2009
15 years 7 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan