Hierarchical modeling of graphs using modular decomposition
نویسندگان
چکیده
منابع مشابه
Drawing graphs using modular decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges, in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings ar...
متن کاملCounting Spanning Trees in Graphs Using Modular Decomposition
In this paper we present an algorithm for determining the number of spanning trees of a graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by contracting the modular decomposition tree of the input graph G in a bottom-up fashion until it becomes a single node; then, the number of spanning trees of G is computed as the product...
متن کاملLinear-time modular decomposition of directed graphs
Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are e cient linear-time algorithms that compute the decomposition for undirected graphs. The best previously published time bound for directed graphs is O(n+m log n), where n is the number of vertices and m is the number of edges. We give an O(n + m)-time algorithm.
متن کاملNonlocal Multiscale Hierarchical Decomposition on Graphs
The decomposition of images into their meaningful components is one of the major tasks in computer vision. Tadmor, Nezzar and Vese [1] have proposed a general approach for multiscale hierarchical decomposition of images. On the basis of this work, we propose a multiscale hierarchical decomposition of functions on graphs. The decomposition is based on a discrete variational framework that makes ...
متن کاملModular decomposition of transitive graphs and transitively orienting their complements
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and algorithms for directed graphs often work by reducing the problem to decomposing undirected graphs. In this paper we show that transitive acyclic digraphs have the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Human Neuroscience
سال: 2018
ISSN: 1662-5161
DOI: 10.3389/conf.fnhum.2018.227.00006