Sciweavers

1883 search results - page 27 / 377
» Ordered theta graphs
Sort
View
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 2 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
COMGEO
2011
ACM
13 years 2 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
13 years 7 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
ENDM
2007
89views more  ENDM 2007»
13 years 7 months ago
Homomorphisms and Polynomial Invariants of Graphs
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
Delia Garijo, Jaroslav Nesetril, M. P. Revuelta