70 search results - page 7 / 14 » On low degree k-ordered graphs |
JCP
2008
14 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
GD
2007
Springer
15 years 3 months ago
2007
Springer
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
AVI
2006
14 years 11 months ago
2006
Graphs provide good representations for many domains. Interactive graph-based interfaces are desireable to browse and edit data for these domains. However, as graphs increase in s...