Generating 3-vertex connected spanning subgraphs

Journal article

Open access

Peer reviewed

Endre Boros, Konrad Borys, Vladimir Gurvich and Gabor Rudolf

Discrete mathematics, Vol.308(24), pp.6285-6297

2008

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Information retrieval. Graph

Theoretical computing

url

https://doi.org/10.1016/j.disc.2007.11.067View

Version of Record (VoR) Open

10 Record Views

Title: Generating 3-vertex connected spanning subgraphs
Creators: Endre Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, United States
Konrad Borys - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, United States
Vladimir Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, United States
Gabor Rudolf - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, United States
Publication Details: Discrete mathematics, Vol.308(24), pp.6285-6297
Date published: 2008
Publisher: Elsevier
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Journal article
Identifiers: 991031665813404646