{"id":"https://openalex.org/W1983758508","doi":"https://doi.org/10.1142/s012905411450018x","title":"ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS","display_name":"ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W1983758508","doi":"https://doi.org/10.1142/s012905411450018x","mag":"1983758508"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411450018x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411450018x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041655022","display_name":"Amr Elmasry","orcid":"https://orcid.org/0000-0002-6549-908X"},"institutions":[{"id":"https://openalex.org/I84524832","display_name":"Alexandria University","ror":"https://ror.org/00mzz1w90","country_code":"EG","type":"education","lineage":["https://openalex.org/I84524832"]}],"countries":["EG"],"is_corresponding":true,"raw_author_name":"AMR ELMASRY","raw_affiliation_strings":["Department of Computer Engineering and Systems, Alexandria University, Alexandria, Egypt"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Systems, Alexandria University, Alexandria, Egypt","institution_ids":["https://openalex.org/I84524832"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079730652","display_name":"Yung H. Tsin","orcid":"https://orcid.org/0000-0001-5987-4659"},"institutions":[{"id":"https://openalex.org/I74413500","display_name":"University of Windsor","ror":"https://ror.org/01gw3d370","country_code":"CA","type":"education","lineage":["https://openalex.org/I74413500"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"YUNG H. TSIN","raw_affiliation_strings":["School of Computer Science, University of Windsor, Windsor, Ontario, Canada","School of Computer Science , University of Windsor , Windsor, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Windsor, Windsor, Ontario, Canada","institution_ids":["https://openalex.org/I74413500"]},{"raw_affiliation_string":"School of Computer Science , University of Windsor , Windsor, Ontario, Canada","institution_ids":["https://openalex.org/I74413500"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041655022"],"corresponding_institution_ids":["https://openalex.org/I84524832"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0873743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"03","first_page":"355","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.5935091972351074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5923562049865723},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5872437953948975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4846535325050354},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.47940489649772644},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46449899673461914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42845618724823},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.42246904969215393},{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.419220894575119},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4020259380340576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3673533797264099},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.331622451543808},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.301790714263916},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1649966835975647}],"concepts":[{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.5935091972351074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5923562049865723},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5872437953948975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4846535325050354},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.47940489649772644},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46449899673461914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42845618724823},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.42246904969215393},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.419220894575119},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4020259380340576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3673533797264099},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.331622451543808},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.301790714263916},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1649966835975647},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411450018x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411450018x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W197905035","https://openalex.org/W1491488300","https://openalex.org/W1534309112","https://openalex.org/W1985142908","https://openalex.org/W1987374783","https://openalex.org/W1994556169","https://openalex.org/W1996575062","https://openalex.org/W1997371115","https://openalex.org/W2014928938","https://openalex.org/W2037219729","https://openalex.org/W2045281628","https://openalex.org/W2068006581","https://openalex.org/W2074520638","https://openalex.org/W2118382442","https://openalex.org/W2265907322","https://openalex.org/W2295936211","https://openalex.org/W2340365916","https://openalex.org/W2520330486","https://openalex.org/W2593081801","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W1512756268","https://openalex.org/W2982430984","https://openalex.org/W2059018062","https://openalex.org/W2393701947","https://openalex.org/W1991172810","https://openalex.org/W167435155","https://openalex.org/W2052731309","https://openalex.org/W4245682093"],"abstract_inverted_index":{"We":[0],"present":[1],"algorithms":[2,27,38,49,77,86,132],"that":[3,13,22,98],"construct":[4],"a":[5,10,19,71,100],"sparse":[6,72,94],"spanning":[7,95],"subgraph":[8,107],"of":[9,18,46,82,121,129,147,167],"three-edge-connected":[11],"graph":[12,21,63,160],"preserves":[14,23],"three-edge":[15,51],"connectivity":[16,54,137],"or":[17,135],"three-vertex-connected":[20],"three-vertex":[24,53,136],"connectivity.":[25],"Our":[26,85],"are":[28,142],"conceptually":[29],"simple":[30,37],"and":[31,52,55,138],"run":[32,78],"in":[33,79,118],"O(|E|)":[34,83],"time.":[35,84],"These":[36],"can":[39],"be":[40],"used":[41],"to":[42,66,70,91,156],"improve":[43,163],"the":[44,47,61,75,93,106,116,122,130,148,158,164],"efficiency":[45,166],"best-known":[48],"for":[50,133],"their":[56,139],"related":[57,140],"problems,":[58],"by":[59],"preprocessing":[60],"input":[62,159],"so":[64,97],"as":[65],"trim":[67],"it":[68,113],"down":[69],"graph.":[73,150],"Afterwards,":[74],"original":[76],"O(|V|)":[80],"instead":[81],"generate":[87],"an":[88,119,145,153],"adjacency-lists":[89,111,154],"structure":[90,112,155],"represent":[92,157],"subgraph,":[96],"when":[99],"depth-first":[101],"search":[102],"is":[103,125],"performed":[104],"over":[105],"based":[108,143],"on":[109,144],"this":[110],"actually":[114],"traverses":[115],"paths":[117],"ear-decomposition":[120,146],"subgraph.":[123],"This":[124],"useful":[126],"because":[127],"many":[128],"existing":[131],"three-edge-":[134],"problems":[141],"given":[149],"Using":[151],"such":[152],"would":[161],"greatly":[162],"run-time":[165],"these":[168],"algorithms.":[169]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}