Sciweavers

193 search results - page 5 / 39
» The structure of almost all graphs in a hereditary property
Sort
View
EJC
1998
13 years 7 months ago
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
Wilfried Imrich, Sandi Klavzar
JAL
1998
85views more  JAL 1998»
13 years 7 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 4 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
WWW
2008
ACM
14 years 8 months ago
Statistical properties of community structure in large social and information networks
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Mi...
JSYML
2010
120views more  JSYML 2010»
13 years 2 months ago
First order properties on nowhere dense structures
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
Jaroslav Nesetril, Patrice Ossona de Mendez