Sciweavers

355 search results - page 35 / 71
» On Central Spanning Trees of a Graph
Sort
View
123
Voted
PVLDB
2010
200views more  PVLDB 2010»
14 years 11 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
106
Voted
JCT
2008
85views more  JCT 2008»
15 years 20 days 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
102
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 16 days ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
107
Voted
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
15 years 16 days ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
COMBINATORICA
2004
119views more  COMBINATORICA 2004»
15 years 16 days ago
On Infinite Cycles II
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
Reinhard Diestel, Daniela Kühn