Generating All the Minimal Separators of a Graph-Reference-Cited by-同舟云学术

Generating All the Minimal Separators of a Graph

Published:1999 Issue: Volume: Page:167-172
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Berry Anne,Bordat Jean-Paul,Cogis Olivier

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46784-X_17

Reference15 articles.

1. A. Berry: A Wide-Range Efficient Algorithm for Minimal Triangulation. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99), Baltimore, Jan. 1999. 167, 168

2. A. Berry: Dïsarticulation d’un graphe. PhD Dissertation LIRMM, 1998. 167

3. A. Berry, J.-B. Bordat: Separability Generalizes Dirac’s Theorem. Discrete Applied Mathematics 84 (1998) 43–53. 167

4. A. Berry, J.-P. Bordat: Orthotreillis et sïparabilitï dans un graphe non-orientï. Mathïmatiques, Informatique et Sciences Humaines 146 (1999) 5–17. 168

5. H. Bodlaender, T. Kloks, D. Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM Journal on Discrete Mathematics 8 (1995) 606–616. 167

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-10-01

2. The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29

3. On the Tractability of Optimization Problems on H-Graphs;Algorithmica;2020-03-11

4. Efficiently Enumerating Minimal Triangulations;Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2017-05-09

5. The k-hop connected dominating set problem: approximation and hardness;Journal of Combinatorial Optimization;2017-03-21