Sciweavers

1395 search results - page 107 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
ARSCOM
2002
70views more  ARSCOM 2002»
14 years 9 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
15 years 11 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
STACS
2007
Springer
15 years 4 months ago
A Cubic Kernel for Feedback Vertex Set
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
Hans L. Bodlaender
CPC
2006
110views more  CPC 2006»
14 years 10 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
GD
2003
Springer
15 years 3 months ago
Track Drawings of Graphs with Constant Queue Number
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
Emilio Di Giacomo, Henk Meijer