On the dualization in distributive lattices and related problems
Oscar Defrain
,
Lhouari Nourine
,
Takeaki Uno
Journal articles
hal-04045983v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
,
Takeaki Uno
et al.
Book sections
hal-02082337v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Counting Minimal Dominating Sets
Mamadou Moustapha Kanté
,
Takeaki Uno
Conference papers
hal-01630342v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Alessio Conte
,
Mamadou Moustapha Kanté
,
Takeaki Uno
,
Kunihiro Wasa
Journal articles
hal-04056493v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
,
Takeaki Uno
et al.
Algorithms and Data Structures (WADS) , Aug 2015, Victoria, Canada. pp.446-457
Conference papers
hal-01248851v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
,
Takeaki Uno
et al.
Conference papers
istex
hal-02083525v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
Alessio Conte
,
Mamadou Moustapha Kanté
,
Yota Otachi
,
Takeaki Uno
,
Kunihiro Wasa
et al.
Journal articles
hal-04056387v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
Alessio Conte
,
Roberto Grossi
,
Mamadou Moustapha Kanté
,
Andrea Marino
,
Takeaki Uno
et al.
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science , Aug 2019, Aachen, Germany. pp.1-14,
⟨10.4230/LIPIcs.MFCS.2019.73⟩
Conference papers
hal-02335601v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On Maximal Cliques with Connectivity Constraints in Directed Graphs
Alessio Conte
,
Mamadou Moustapha Kanté
,
Takeaki Uno
,
Kunihiro Wasa
Conference papers
hal-01630384v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph
Alessio Conte
,
Mamadou Moustapha Kanté
,
Yota Otachi
,
Takeaki Uno
,
Kunihiro Wasa
et al.
Computing and Combinatorics - 23rd International Conference, {COCOON} 2017, Hong Kong, China, August 3-5, 2017, Proceedings , 2017, Hong Kong, China. pp.150-161,
⟨10.1007/978-3-319-62389-4_13⟩
Conference papers
hal-01630354v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More