Sciweavers

704 search results - page 18 / 141
» Isometrically Embedded Graphs
Sort
View
MLG
2007
Springer
14 years 1 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
ITCC
2003
IEEE
14 years 26 days ago
Distance-Hereditary Embeddings of Circulant Graphs
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
Carmen Martínez, Ramón Beivide, Jaim...
FAC
2002
66views more  FAC 2002»
13 years 7 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
COMBINATORICS
2006
110views more  COMBINATORICS 2006»
13 years 7 months ago
Jamming and Geometric Representations of Graphs
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
Werner Krauth, Martin Loebl
COMBINATORICA
2007
117views more  COMBINATORICA 2007»
13 years 7 months ago
Embedding nearly-spanning bounded degree trees
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
Noga Alon, Michael Krivelevich, Benny Sudakov