Art
J-GLOBAL ID：202002250494408932
Reference number：20A0896325
Enumerating 2-Edge-Connected Induced Subgraphs
2エッジ接続の誘導部分グラフの列挙
Author (3)：
,
,
Material：
Volume：
2020
Issue：
AL-177
Page：
Vol.2020-AL-177,No.7,1-7 (WEB ONLY)
Publication year：
Mar. 09, 2020
JST Material Number：
U0451A
Document type：
Proceedings
Article type：
原著論文
Country of issue：
Japan (JPN)
Language：
ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,
,
,
,
,
,
,
,
,
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,
,
,
JST classification (1)：
JST classification
Category name(code) classified by JST.
Basics of graph theory
Reference (24)：
-
Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In Proceedings of the 22nd ACM International Conference on Information and Knowledge Management (CIKM 2013), pages 909-918, 2013.
-
David Avis and Komei Fukuda. Reverse search for enumeration. Discrete Applied Mathematics, 65(1-3):21-46, 1996.
-
Etienne Birmelé, Rui Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, and Gustavo Sacomoto. Optimal Listing of Cycles and st-Paths in Undirected Graphs. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pages 1884-1896, January 2012.
-
Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, and Gábor Rudolf. Generating minimal k-vertex connected spanning subgraphs. In Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), pages 222-231, 2007.
-
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, and Kunihiro Wasa. Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph. In Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), pages 150-161, 2017.
ｍore...
Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
,
,
Return to Previous Page
