Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Theory of 2-structures. Part I: clans, basic subclasses, and morphisms
Theoretical Computer Science
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Centroids, representations, and submodular flows
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Theoretical Computer Science
Branch-width and well-quasi-ordering in matroids and graphs
Journal of Combinatorial Theory Series B
Canonical decompositions of symmetric submodular systems
Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
A complete complexity classification of the role assignment problem
Theoretical Computer Science - Graph colorings
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Feedback Vertex Set on Graphs of Low Cliquewidth
Combinatorial Algorithms
Parameterized and Exact Computation
Journal of Computer and System Sciences
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
A representation theorem for union-difference families and application
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A generic approach to decomposition algorithms, with an application to digraph decomposition
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Bimodular decomposition of bipartite graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
A generic approach to decomposition algorithms, with an application to digraph decomposition
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Hi-index | 0.00 |
The number of families over ground set V is 2^2^^^|^^^V^^^| and by this fact it is not possible to represent such a family using a number of bits polynomial in |V|. However, under some simple conditions, this becomes possible, like in the cases of a symmetric crossing family and a weakly partitive family, both representable using @Q(|V|) space. We give a general framework for representing any set family by a tree. It extends in a natural way the one used for symmetric crossing families in [W. Cunningham, J. Edmonds, A combinatorial decomposition theory, Canadian Journal of Mathematics 32 (1980) 734-765]. We show that it also captures the one used for weakly partitive families in [M. Chein, M. Habib, M.C. Maurer, Partitive hypergraphs, Discrete Mathematics 37 (1) (1981) 35-50]. We introduce two new classes of families: weakly partitive crossing families are those closed under the union, the intersection, and the difference of their crossing members, and union-difference families those closed under the union and the difference of their overlapping members. Each of the two cases encompasses symmetric crossing families and weakly partitive families. Applying our framework, we obtain a linear @Q(|V|) and a quadratic O(|V|^2) space representation based on a tree for them. We introduce the notion of a sesquimodule - one module and a half - in a digraph and in a generalization of digraphs called 2-structure. From our results on set families, we show for any digraph, resp. 2-structure, a unique decomposition tree using its sesquimodules. These decompositions generalize strictly the clan decomposition of a digraph and that of a 2-structure. We give polynomial time algorithms computing the decomposition tree for both cases of sesquimodular decomposition.