{"id":"https://openalex.org/W1566758013","doi":"https://doi.org/10.1007/3-540-37623-2_22","title":"NP-Completeness of Some Tree-Clustering Problems","display_name":"NP-Completeness of Some Tree-Clustering Problems","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1566758013","doi":"https://doi.org/10.1007/3-540-37623-2_22","mag":"1566758013"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-37623-2_22","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-37623-2_22","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-37623-2_22.pdf","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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-37623-2_22.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003441276","display_name":"Falk Schreiber","orcid":"https://orcid.org/0000-0002-9307-3254"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Falk Schreiber","raw_affiliation_strings":["University of Passau, 94032, Passau, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Passau, 94032, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021261521","display_name":"K. Skodinis","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Konstantinos Skodinis","raw_affiliation_strings":["University of Passau, 94032, Passau, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Passau, 94032, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.18539326,"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":"288","last_page":"301"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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.9976000189781189,"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/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.6199538111686707},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.586673378944397},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5367945432662964},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5230485200881958},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5061158537864685},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4817395508289337},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4785383641719818},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.44761449098587036},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4186535179615021},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.41518712043762207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.337394118309021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33366796374320984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32526516914367676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2920094132423401},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2692025303840637},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.190446138381958},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08579111099243164},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07909220457077026},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.07540717720985413}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6199538111686707},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.586673378944397},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5367945432662964},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5230485200881958},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5061158537864685},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4817395508289337},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4785383641719818},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.44761449098587036},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4186535179615021},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.41518712043762207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.337394118309021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33366796374320984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32526516914367676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2920094132423401},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2692025303840637},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.190446138381958},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08579111099243164},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07909220457077026},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.07540717720985413},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/3-540-37623-2_22","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-37623-2_22","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-37623-2_22.pdf","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.5392","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5392","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fmi.uni-passau.de/~schreibe/files/ps8.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://link.springer-ny.com/link/service/series/0558/tocs/../papers/1547/15470288.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.60","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.60","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://brahms.fmi.uni-passau.de/~skodinis/treeclust.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.1627","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.1627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fmi.uni-passau.de/~schreibe/bibtex/ps8.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.7312","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.7312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pgrc-16.ipk-gatersleben.de/~schreibe/publications/SchreiberS98.pdf","raw_type":"text"},{"id":"pmh:oai:gdea.informatik.uni-koeln.de:336","is_oa":false,"landing_page_url":"http://gdea.informatik.uni-koeln.de/336/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196197","display_name":"gdea - Graph Drawing E-print Archive (GDEA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":{"id":"doi:10.1007/3-540-37623-2_22","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-37623-2_22","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-37623-2_22.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1566758013.pdf","grobid_xml":"https://content.openalex.org/works/W1566758013.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W95676818","https://openalex.org/W272982077","https://openalex.org/W1507837710","https://openalex.org/W1536219318","https://openalex.org/W1536773822","https://openalex.org/W1567692704","https://openalex.org/W1572701995","https://openalex.org/W1964448775","https://openalex.org/W2011039300","https://openalex.org/W2034350206","https://openalex.org/W2059936808","https://openalex.org/W2066714987","https://openalex.org/W2071353749","https://openalex.org/W2085550081","https://openalex.org/W2167482691","https://openalex.org/W2286999769","https://openalex.org/W6632234613","https://openalex.org/W6634386295"],"related_works":["https://openalex.org/W2995115154","https://openalex.org/W4287991942","https://openalex.org/W943012151","https://openalex.org/W193918669","https://openalex.org/W1997570556","https://openalex.org/W2611872667","https://openalex.org/W2270553684","https://openalex.org/W2005362242","https://openalex.org/W2126464568","https://openalex.org/W2979218215"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}