Listing all potential maximal cliques of a graph
Theoretical Computer Science
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Generating All the Minimal Separators of a Graph
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Minimal Triangulations for Graphs with "Few" Minimal Separators
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Node-searching problem on block graphs
Discrete Applied Mathematics
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Treewidth and minimum fill-in of weakly triangulated graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science
Minimal separators in extended P4-laden graphs
Discrete Applied Mathematics
Approximate search strategies for weighted trees
Theoretical Computer Science
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Hi-index | 0.00 |