JOURNAL ARTICLE

Two-edge connected spanning subgraphs and polyhedra

A. Ridha Mahjoub

Year: 1994 Journal:   Mathematical Programming Vol: 64 (1-3)Pages: 199-208   Publisher: Springer Science+Business Media
Keywords:
Polytope Polyhedron Combinatorics Mathematics Travelling salesman problem Graph Enhanced Data Rates for GSM Evolution Discrete mathematics Mathematical optimization Computer science Artificial intelligence

Metrics

77
Cited By
9.86
FWCI (Field Weighted Citation Impact)
24
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Optimization and Packing Problems
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering

Related Documents

JOURNAL ARTICLE

Finding 2-edge connected spanning subgraphs

Woonghee Tim Huh

Journal:   Operations Research Letters Year: 2003 Vol: 32 (3)Pages: 212-216
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

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

Spanning even subgraphs of 3‐edge‐connected graphs

Bill JacksonKiyoshi Yoshimoto

Journal:   Journal of Graph Theory Year: 2009 Vol: 62 (1)Pages: 37-47
© 2026 ScienceGate Book Chapters — All rights reserved.