Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Generating All the Minimal Separators of a Graph
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
A local approach to concept generation
Annals of Mathematics and Artificial Intelligence
Representing a concept lattice by a graph
Discrete Applied Mathematics
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Discrete Applied Mathematics
Situation monitoring and analysis of security risk for networked services
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 5.23 |