{"id":"https://openalex.org/W2076505206","doi":"https://doi.org/10.1002/net.3230170103","title":"Graph folding and programmable logic array","display_name":"Graph folding and programmable logic array","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2076505206","doi":"https://doi.org/10.1002/net.3230170103","mag":"2076505206"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5087577528","display_name":"T. C. Hu","orcid":"https://orcid.org/0009-0005-0844-7506"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. C. Hu","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, San Diego, La Jolla, California 92093","University of California at San Diego, La Jolla"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, San Diego, La Jolla, California 92093","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California at San Diego, La Jolla","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060210664","display_name":"Y.S. Kuo","orcid":"https://orcid.org/0009-0008-6542-0192"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Y. S. Kuo","raw_affiliation_strings":["Institute of Information Science, Academia Sinia, Taipei, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinia, Taipei, Taiwan, R.O.C","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087577528"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5157,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.64169831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"1","first_page":"19","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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/T10142","display_name":"Formal Methods in Verification","score":0.9965000152587891,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7406258583068848},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.676006555557251},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.6378769278526306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5992222428321838},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.47328776121139526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4566369354724884},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4449375867843628},{"id":"https://openalex.org/keywords/simplex-graph","display_name":"Simplex graph","score":0.4320530891418457},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.42099636793136597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.415760338306427},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4140293300151825},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.41202548146247864},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4102388918399811},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37799352407455444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24885869026184082}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7406258583068848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.676006555557251},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.6378769278526306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5992222428321838},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.47328776121139526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4566369354724884},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4449375867843628},{"id":"https://openalex.org/C202183611","wikidata":"https://www.wikidata.org/wiki/Q7520883","display_name":"Simplex graph","level":5,"score":0.4320530891418457},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.42099636793136597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.415760338306427},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4140293300151825},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.41202548146247864},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4102388918399811},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37799352407455444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24885869026184082},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":5,"referenced_works":["https://openalex.org/W1666015432","https://openalex.org/W1967575124","https://openalex.org/W2001885513","https://openalex.org/W2143551146","https://openalex.org/W4249055192"],"related_works":["https://openalex.org/W2372962357","https://openalex.org/W1507581786","https://openalex.org/W2379970161","https://openalex.org/W4387947554","https://openalex.org/W2395946795","https://openalex.org/W921027354","https://openalex.org/W2502944414","https://openalex.org/W4254020973","https://openalex.org/W2351525604","https://openalex.org/W2076505206"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"problem":[2],"of":[3,26,105],"compacting":[4],"a":[5,17,49,67,82,89,98],"programmable":[6],"logic":[7],"array":[8],"is":[9],"formulated":[10],"as":[11],"the":[12,59,70,78,103],"following":[13],"graph":[14,62,72,92],"problem.":[15],"Given":[16],"red\u2010edge":[18],"bipartite":[19,61,71,91],"graph,":[20],"how":[21],"to":[22],"add":[23],"maximum":[24],"number":[25,104],"independent":[27],"green":[28,41,106],"edges":[29],"such":[30],"that":[31],"there":[32],"are":[33],"no":[34],"cycles":[35],"formed":[36],"by":[37],"alternating":[38],"red":[39,60,90],"and":[40],"edges.":[42,107],"For":[43,88],"this":[44],"NP\u2010complete":[45],"problem,":[46],"we":[47,96],"present":[48],"polynomial":[50],"heuristic":[51,79],"algorithm":[52,80],"which":[53],"gives":[54,81],"an":[55],"optimum":[56],"solution":[57,83],"when":[58],"satisfies":[63],"certain":[64],"conditions,":[65,77],"e.g.,":[66],"tree.":[68],"When":[69],"does":[73],"not":[74],"satisfy":[75],"these":[76],"with":[84,93],"worst\u2010case":[85],"error":[86],"bound.":[87],"given":[94],"cardinality,":[95],"give":[97],"tight":[99],"upper":[100],"bound":[101],"on":[102]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}