Results 1  10
of
217,157
Graph Decompositions and Factorizing Permutations
 Discrete Mathematics and Theoretical Computer Science
, 1997
"... A factorizing permutation of a given undirected graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for modular decomposition and we propo ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
A factorizing permutation of a given undirected graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for modular decomposition and we
Spectral segmentation with multiscale graph decomposition
 In CVPR
, 2005
"... We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, without iteration, to capture both coarse and fine level details. The algorithm is computationally efficient, allowing to ..."
Abstract

Cited by 180 (3 self)
 Add to MetaCart
at increasingly large neighborhood. We show that the decomposition of the image segmentation graph into different scales can be determined by ecological statistics on the image grouping cues. Our segmentation algorithm works simultaneously across the graph scales, with an interscale constraint to ensure
Graph Decomposition and Transitive Closures
"... Abstract. In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅b) time and O(n⋅b) space, where n is the number of the nodes of t ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅b) time and O(n⋅b) space, where n is the number of the nodes
Graph Decomposition of Slim Graphs
"... A Graph G = (V; E) is called kslim if for every subgraph S = (V S ; ES ) of G with s = jV S j k there exists K ae V S , jKj = k, such that the vertices of V S n K can be partitioned into two subsets, A and B, such that jAj 2 3 s and jBj 2 3 s and no edge of ES connects a vertex from A and ..."
Abstract
 Add to MetaCart
and a vertex from B. kslim graphs contain, in particular, the graphs with treewidth k. In this paper we give an algorithm solving the Hdecomposition problem for a large family of graphs H which contains, among others, the stars, the complete graphs, and the complete rpartite graphs where r 3
UNGRADE:UNsupervised GRAph DEcomposition
"... This article presents an unsupervised algorithm for word decomposition called UNGRADE (UNsupervised GRAph DEcomposition) to segment any word list of any language. UNGRADE assumes that each word follows the structure prefixes, a stem and suffixes without giving a limit on the number of prefixes and s ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This article presents an unsupervised algorithm for word decomposition called UNGRADE (UNsupervised GRAph DEcomposition) to segment any word list of any language. UNGRADE assumes that each word follows the structure prefixes, a stem and suffixes without giving a limit on the number of prefixes
Shape analysis by graph decomposition
 In 13th TACAS
, 2007
"... Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the program satisfies certain safety properties or invariants. In this paper, we show how this independence between different ( ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(singlylinked) data structures can be utilized to perform shape analysis and verification more efficiently. We present a new abstraction based on decomposing graphs into sets of subgraphs, and show that, in practice, this new abstraction leads to very little loss of precision, while yielding substantial
Graph Decompositions and Secret Sharing Schemes
 Journal of Cryptology
, 1995
"... In this paper, we continue a study of secret sharing schemes for access structures based on graphs. Given a graph G, we require that a subset of participants can compute a secret key if they contain an edge of G; otherwise, they can obtain no information regarding the key. We study the information r ..."
Abstract

Cited by 51 (11 self)
 Add to MetaCart
on the optimal information rate and average information rate that can be obtained. Upper bounds arise by applying entropy arguments due to Capocelli et al [15]. Lower bounds come from constructions that are based on graph decompositions. Application of these constructions requires solving a particular linear
On graph decompositions modulo k
"... We prove that, for every integer k ≥ 2, every graph has an edgepartition into 5k 2 log k sets, each of which is the edgeset of a graph with all degrees congruent to 1 mod k. This answers a question of Pyber. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove that, for every integer k ≥ 2, every graph has an edgepartition into 5k 2 log k sets, each of which is the edgeset of a graph with all degrees congruent to 1 mod k. This answers a question of Pyber.
Densityfriendly Graph Decomposition
"... Decomposing a graph into a hierarchical structure via kcore analysis is a standard operation in any modern graphmining toolkit. kcore decomposition is a simple and efficient method that allows to analyze a graph beyond its mere degree distribution. More specifically, it is used to identify areas ..."
Abstract
 Add to MetaCart
Decomposing a graph into a hierarchical structure via kcore analysis is a standard operation in any modern graphmining toolkit. kcore decomposition is a simple and efficient method that allows to analyze a graph beyond its mere degree distribution. More specifically, it is used to identify
Results 1  10
of
217,157