2503 search results - page 20 / 501 » A study of 3-arc graphs |
GG
2004
Springer
14 years 3 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
LAWEB
2003
IEEE
14 years 2 months ago
2003
IEEE
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
INFOCOM
2012
IEEE
12 years 3 days ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
DAM
1999
13 years 9 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...