JOURNAL ARTICLE
Finding 2-edge connected spanning subgraphs
Year: 2003 Journal: Operations Research Letters Vol: 32 (3)Pages: 212-216 Publisher: Elsevier BV
Keywords:
Combinatorics Vertex connectivity Mathematics Enhanced Data Rates for GSM Evolution Graph Connectivity Connected component Spanning tree Graph factorization Discrete mathematics Computer science Line graph Graph power Artificial intelligence
Metrics
17
Cited By
0.35
FWCI (Field Weighted Citation Impact)
11
Refs
0.56
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS
Journal: International Journal of Foundations of Computer Science Year: 2014 Vol: 25 (03)Pages: 355-368
JOURNAL ARTICLE
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
Xiangwen LiChunxiang WangQiong FanZhaohong NiuLiming Xiong
Journal: Graphs and Combinatorics Year: 2011 Vol: 29 (2)Pages: 275-280
JOURNAL ARTICLE
Enumerating Highly-Edge-Connected Spanning Subgraphs
Katsuhisa YamanakaYasuko MatsuiShin-ichi Nakano
Journal: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences Year: 2019 Vol: E102.A (9)Pages: 1002-1006
JOURNAL ARTICLE
Packing spanning trees and spanning 2-connected k-edge-connected essentially $$(2k-1)$$ ( 2 k - 1 ) -edge-connected subgraphs
Journal: Journal of Combinatorial Optimization Year: 2016 Vol: 33 (3)Pages: 924-933
JOURNAL ARTICLE
Two-edge connected spanning subgraphs and polyhedra
Journal: Mathematical Programming Year: 1994 Vol: 64 (1-3)Pages: 199-208