Sciweavers

2503 search results - page 233 / 501
» A study of 3-arc graphs
Sort
View
AVI
2006
15 years 8 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
15 years 8 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
GG
2008
Springer
15 years 7 months ago
Adaptive Star Grammars for Graph Models
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Frank Drewes, Berthold Hoffmann, Mark Minas
DM
2010
102views more  DM 2010»
15 years 6 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
ICASSP
2011
IEEE
14 years 10 months ago
Downsampling graphs using spectral theory
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
Sunil K. Narang, Antonio Ortega