{"id":"https://openalex.org/W2036722411","doi":"https://doi.org/10.1137/s0097539703421620","title":"The Minimum All-Ones Problem for Trees","display_name":"The Minimum All-Ones Problem for Trees","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2036722411","doi":"https://doi.org/10.1137/s0097539703421620","mag":"2036722411"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703421620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703421620","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5074795333","display_name":"William Y. C. Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"William Y. C. Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100365966","display_name":"Xueliang Li","orcid":"https://orcid.org/0000-0002-8335-9873"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xueliang Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100407017","display_name":"Chao Wang","orcid":"https://orcid.org/0000-0002-6251-7908"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chao Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100352066","display_name":"Xiaoyan Zhang","orcid":"https://orcid.org/0000-0002-2224-1484"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaoyan Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0767,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.864626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"33","issue":"2","first_page":"379","last_page":"392"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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.9973999857902527,"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/T12162","display_name":"Cellular Automata and Applications","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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9904999732971191,"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/mathematics","display_name":"Mathematics","score":0.6424026489257812},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5968985557556152},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5609531402587891},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.507900059223175},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.49674731492996216},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43429869413375854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4315212666988373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40974751114845276}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6424026489257812},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5968985557556152},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5609531402587891},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.507900059223175},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.49674731492996216},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43429869413375854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4315212666988373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40974751114845276}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539703421620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703421620","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W84141961","https://openalex.org/W1502855729","https://openalex.org/W1975858062","https://openalex.org/W1981580454","https://openalex.org/W2010024483","https://openalex.org/W2032375758","https://openalex.org/W2036100124","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2580495080","https://openalex.org/W4229810805","https://openalex.org/W4230232937"],"related_works":["https://openalex.org/W2115439754","https://openalex.org/W2254257826","https://openalex.org/W2558105755","https://openalex.org/W2963826714","https://openalex.org/W2021372200","https://openalex.org/W4221160330","https://openalex.org/W3083556879","https://openalex.org/W1496611045","https://openalex.org/W1538330076","https://openalex.org/W2261299644"],"abstract_inverted_index":{"The":[0],"minimum":[1,87,102],"all-ones":[2,47,69,103,119],"problem":[3,17,38,48,91,104,120],"was":[4],"shown":[5],"to":[6,18,45,117],"be":[7],"NP-complete":[8],"for":[9,24,39,42,49,76,100,105,114],"general":[10],"graphs.":[11],"Therefore,":[12],"it":[13],"becomes":[14],"an":[15],"interesting":[16],"identify":[19],"special":[20],"classes":[21],"of":[22,56,66,79],"graphs":[23],"which":[25],"one":[26],"can":[27],"find":[28],"polynomial":[29],"time":[30,98,112],"algorithms.":[31],"In":[32],"this":[33,37],"paper":[34],"we":[35,52,72,94],"consider":[36],"trees.":[40,106],"First,":[41],"any":[43],"solution":[44,61],"the":[46,57,60,64,67,74,77,86,101,118],"a":[50,54,82,96,110,122],"tree,":[51],"give":[53,73],"characterization":[55],"elements":[58],"in":[59,81,121],"by":[62],"introducing":[63],"concept":[65],"quasi":[68],"problem.":[70],"Then":[71],"enumeration":[75],"number":[78],"solutions":[80,116],"tree.":[83],"By":[84],"using":[85],"odd":[88],"(even)":[89],"sum":[90],"as":[92],"subprocess,":[93],"obtain":[95],"linear":[97,111],"algorithm":[99,113],"We":[107],"also":[108],"get":[109],"finding":[115],"unicyclic":[123],"graph.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}