{"id":"https://openalex.org/W1496725729","doi":"https://doi.org/10.1007/bfb0015449","title":"NC algorithms for partitioning sparse graphs into induced forests with an application","display_name":"NC algorithms for partitioning sparse graphs into induced forests with an application","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1496725729","doi":"https://doi.org/10.1007/bfb0015449","mag":"1496725729"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0015449","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0015449","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":["Dept. of Math. Sci., Tokyo Denki Univ., Hatoyama, 350-03, Saitama, Japan","Dept. of Math. Sci., Tokyo Denki Univ., Saitama, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. of Math. Sci., Tokyo Denki Univ., Hatoyama, 350-03, Saitama, Japan","institution_ids":["https://openalex.org/I165522056"]},{"raw_affiliation_string":"Dept. of Math. Sci., Tokyo Denki Univ., Saitama, Japan","institution_ids":["https://openalex.org/I165522056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":["https://openalex.org/I165522056"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.13455913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"428","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6952673196792603},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6742547154426575},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5516553521156311},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4822174310684204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4586906135082245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44955217838287354},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.43741557002067566},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.43219539523124695},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4281981587409973},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41630759835243225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38831672072410583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37564384937286377}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6952673196792603},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6742547154426575},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5516553521156311},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4822174310684204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4586906135082245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44955217838287354},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.43741557002067566},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.43219539523124695},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4281981587409973},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41630759835243225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38831672072410583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37564384937286377}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bfb0015449","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0015449","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.7400000095367432,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W181843685","https://openalex.org/W1965633932","https://openalex.org/W1982180670","https://openalex.org/W1985224030","https://openalex.org/W1989544707","https://openalex.org/W2011039300","https://openalex.org/W2045027193","https://openalex.org/W2046693802","https://openalex.org/W2048838677","https://openalex.org/W2052409046","https://openalex.org/W2077571023","https://openalex.org/W2156760067"],"related_works":["https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803","https://openalex.org/W2023492687","https://openalex.org/W2559887149","https://openalex.org/W4237685082","https://openalex.org/W4295679086","https://openalex.org/W2963904776","https://openalex.org/W2957420444"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}