scholarly journals Modular Decomposition-Based Graph Compression for Fast Reachability Detection

2019 ◽  
Vol 4 (3) ◽  
pp. 193-207 ◽  
Author(s):  
Shikha Anirban ◽  
Junhu Wang ◽  
Md. Saiful Islam
Keyword(s):  
Modular Decomposition ◽  
Graph Compression

Graph Compression based on Transitivity for Neighborhood Query

2021 ◽  
Author(s):  
Amin Emamzadeh Esmaeili Nejad ◽  
Mansoor Zolghadri Jahromi ◽  
Mohammad Taheri
Keyword(s):  
Graph Compression

scholarly journals G-CREWE: Graph CompREssion With Embedding for Network Alignment

2020 ◽  
Author(s):  
Kyle K. Qin ◽  
Flora D. Salim ◽  
Yongli Ren ◽  
Wei Shao ◽  
Mark Heimann ◽  
...  
Keyword(s):  
Network Alignment ◽  
Graph Compression

scholarly journals Clique Partitions, Graph Compression and Speeding-Up Algorithms

1995 ◽  
Vol 51 (2) ◽  
pp. 261-272 ◽  
Author(s):  
T. Feder ◽  
R. Motwani
Keyword(s):  
Graph Compression

Modular Decomposition of Flow Chart Path Method and its Application

2011 ◽  
Vol 418-420 ◽  
pp. 2206-2210
Author(s):  
Meng Qi Li ◽  
Dong Ying Li
Keyword(s):  
Complex System ◽  
Case Analysis ◽  
Flow Chart ◽  
Function Model ◽  
Modular Decomposition ◽  
Dependency Relationship ◽  
Product Function ◽  
Paper Product ◽  
Material Information ◽  
Relationship Of

Modular decomposition is the key to simplify complex system. In this paper product function model is built based on flow chart description of energy, substance/material information. According to dependency relationship of function, function modularization is done respectively with module defining ways of main path method (MPM), branch path method (BPM) and conversion-conduction method (CCM). And modular decomposition of flow chart path method is established, concerned procedures and cautions during the implementing course are defined, and the purpose and effectiveness of modular decomposition of flow chart pass are confirmed through case analysis.

scholarly journals Decomposing Sets of Inversions

10.37236/2609 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Lukas Katthän
Keyword(s):  
Modular Decomposition ◽  
Substitution Decomposition ◽  
Special Case

In this paper we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subsets, which are themselves inversion sets of permutations in $S_n$. Our method is to study the modular decomposition of the inversion graph of $\pi$. A correspondence to the substitution decomposition of $\pi$ is also given. Moreover, we consider the special case of multiplicative decompositions.

Sign in / Sign up

Export Citation Format

Share Document