Sciweavers

3267 search results - page 128 / 654
» Generalized quasirandom graphs
Sort
View
CORR
2004
Springer
108views Education» more  CORR 2004»
14 years 11 months ago
The lattice dimension of a graph
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into f , the f-dimensional Fibonacci cube. We give b...
David Eppstein
GC
2010
Springer
14 years 10 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
JCT
2010
112views more  JCT 2010»
14 years 9 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
ICIAP
2009
ACM
14 years 9 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun
IADIS
2008
15 years 23 days ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...