{"id":"https://openalex.org/W2073837698","doi":"https://doi.org/10.1145/2817460.2817502","title":"An algorithm for a special graph","display_name":"An algorithm for a special graph","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2073837698","doi":"https://doi.org/10.1145/2817460.2817502","mag":"2073837698"},"language":"en","primary_location":{"id":"doi:10.1145/2817460.2817502","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2817460.2817502","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2817460.2817502","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2817460.2817502","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040231576","display_name":"Tai-Chi Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I27920566","display_name":"Saginaw Valley State University","ror":"https://ror.org/01y7m0485","country_code":"US","type":"education","lineage":["https://openalex.org/I27920566"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tai-Chi Lee","raw_affiliation_strings":["Saginaw Valley State University, University Center, MI","[Saginaw Valley State University University Center, MI]"],"affiliations":[{"raw_affiliation_string":"Saginaw Valley State University, University Center, MI","institution_ids":["https://openalex.org/I27920566"]},{"raw_affiliation_string":"[Saginaw Valley State University University Center, MI]","institution_ids":["https://openalex.org/I27920566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040231576"],"corresponding_institution_ids":["https://openalex.org/I27920566"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22118239,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9965000152587891,"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.9965000152587891,"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.9950000047683716,"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/T11476","display_name":"Graph theory and applications","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7099270820617676},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5864682793617249},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5679473876953125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5317906737327576},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.46919888257980347},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.4559290409088135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4533311128616333},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4443945288658142},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41336846351623535},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4106515049934387},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.38583266735076904}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7099270820617676},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5864682793617249},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5679473876953125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5317906737327576},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.46919888257980347},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4559290409088135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4533311128616333},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4443945288658142},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41336846351623535},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4106515049934387},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.38583266735076904}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2817460.2817502","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2817460.2817502","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2817460.2817502","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2817460.2817502","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2817460.2817502","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2817460.2817502","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2073837698.pdf","grobid_xml":"https://content.openalex.org/works/W2073837698.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2117632582","https://openalex.org/W4388347373"],"abstract_inverted_index":{"Most":[0],"of":[1,24,31,40,56,79,104],"practical":[2],"problems":[3],"which":[4,52],"call":[5],"for":[6,18,27,82,113],"graph":[7,34,85,94],"theory":[8,35],"involve":[9],"large":[10],"graphs":[11,13],"-":[12,66],"that":[14],"are":[15],"virtually":[16],"impossible":[17],"hand":[19],"computation.":[20],"In":[21,45],"fact,":[22],"one":[23],"the":[25,28,38,41,54,93,102,108],"reasons":[26],"recent":[29],"growth":[30],"interest":[32],"in":[33,107],"has":[36,117],"been":[37],"arrival":[39],"high-speed":[42],"electronic":[43],"computer.":[44],"this":[46],"paper,":[47],"we":[48],"propose":[49],"an":[50,115],"algorithm":[51,74,116],"take":[53],"advantages":[55],"computing":[57],"power":[58],"gained":[59],"from":[60],"a":[61,83,96],"machine":[62],"with":[63],"parallel":[64],"architecture":[65],"A":[67],"shared":[68],"memory":[69],"split":[70],"bus":[71],"system.":[72,88],"The":[73,110],"is":[75,95],"to":[76],"perform":[77],"multiplications":[78],"adjacency":[80],"matrices":[81],"given":[84],"using":[86],"such":[87,114],"Therefore,":[89],"it":[90],"determines":[91],"whether":[92],"bipartite":[97],"or":[98],"not":[99],"based":[100],"on":[101],"existence":[103],"odd":[105],"cycles":[106],"graph.":[109],"simulation":[111],"model":[112],"shown":[118],"some":[119],"favorable":[120],"results.":[121]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}