{"id":"https://openalex.org/W2499057545","doi":"https://doi.org/10.1145/2851613.2851650","title":"On structure preserving sampling and approximate partitioning of graphs","display_name":"On structure preserving sampling and approximate partitioning of graphs","publication_year":2016,"publication_date":"2016-04-04","ids":{"openalex":"https://openalex.org/W2499057545","doi":"https://doi.org/10.1145/2851613.2851650","mag":"2499057545"},"language":"en","primary_location":{"id":"doi:10.1145/2851613.2851650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2851613.2851650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM Symposium on Applied Computing","raw_type":"proceedings-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/A5043700615","display_name":"Wouter van Heeswijk","orcid":"https://orcid.org/0000-0002-5413-9660"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Wouter van Heeswijk","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019818981","display_name":"George Fletcher","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"George H. L. Fletcher","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022601535","display_name":"Mykola Pechenizkiy","orcid":"https://orcid.org/0000-0003-4955-0743"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mykola Pechenizkiy","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043700615"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.8839,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7553625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"875","last_page":"882"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7861917018890381},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6482874155044556},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6298403739929199},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5284243226051331},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5257773399353027},{"id":"https://openalex.org/keywords/analytics","display_name":"Analytics","score":0.5161989331245422},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32517915964126587},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2660577595233917},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07437214255332947}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7861917018890381},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6482874155044556},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6298403739929199},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5284243226051331},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5257773399353027},{"id":"https://openalex.org/C79158427","wikidata":"https://www.wikidata.org/wiki/Q485396","display_name":"Analytics","level":2,"score":0.5161989331245422},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32517915964126587},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2660577595233917},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07437214255332947}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2851613.2851650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2851613.2851650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM Symposium on Applied Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/019b3917-8e31-4d67-9448-2b1aacfe6702","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/019b3917-8e31-4d67-9448-2b1aacfe6702","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van Heeswijk, W, Fletcher, G H L & Pechenizkiy, M 2016, On structure preserving sampling and approximate partitioning of graphs. in SAC '16 Proceedings of the 31st Annual ACM Symposium on Applied Computing, 4-8 April 2016, Pisa, Italy. Association for Computing Machinery, Inc., New York, blz. 875-882. https://doi.org/10.1145/2851613.2851650","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/019b3917-8e31-4d67-9448-2b1aacfe6702","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/019b3917-8e31-4d67-9448-2b1aacfe6702","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SAC '16 Proceedings of the 31st Annual ACM Symposium on Applied Computing, 4-8 April 2016, Pisa, Italy, 875 - 882","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1523769434","https://openalex.org/W1550080987","https://openalex.org/W1556261722","https://openalex.org/W1875112053","https://openalex.org/W1999446611","https://openalex.org/W2019040312","https://openalex.org/W2021969955","https://openalex.org/W2022490362","https://openalex.org/W2030451946","https://openalex.org/W2057741363","https://openalex.org/W2059273139","https://openalex.org/W2064127653","https://openalex.org/W2107860787","https://openalex.org/W2113513143","https://openalex.org/W2124171725","https://openalex.org/W2135764373","https://openalex.org/W2146008005","https://openalex.org/W2160181753","https://openalex.org/W2167295942","https://openalex.org/W2199530723","https://openalex.org/W2406390504","https://openalex.org/W2951202447","https://openalex.org/W2963316155","https://openalex.org/W4230799834","https://openalex.org/W4285719527","https://openalex.org/W6631547431","https://openalex.org/W6656037121"],"related_works":["https://openalex.org/W1495872178","https://openalex.org/W1522712643","https://openalex.org/W2102135785","https://openalex.org/W2136070637","https://openalex.org/W2089212807","https://openalex.org/W2783071694","https://openalex.org/W1976268573","https://openalex.org/W1553849808","https://openalex.org/W3096633875","https://openalex.org/W2124122503"],"abstract_inverted_index":{"Massive":[0],"graphs":[1,77],"are":[2],"becoming":[3],"increasingly":[4],"common":[5],"in":[6,50,66,78,109],"a":[7,88],"variety":[8],"of":[9,24,48,61,76,82,96,105],"domains":[10],"such":[11],"as":[12],"social":[13],"networks":[14],"and":[15,31,112],"web":[16],"analytics.":[17],"One":[18],"approach":[19],"to":[20,27,39],"overcoming":[21],"the":[22,29,35,42,46,51,59,73,102],"challenges":[23],"size":[25],"is":[26],"sample":[28,43],"graph,":[30],"perform":[32],"analytics":[33],"on":[34],"smaller":[36],"graph.":[37,53],"However,":[38],"be":[40],"useful,":[41],"must":[44],"maintain":[45],"properties":[47],"interest":[49],"original":[52],"In":[54],"this":[55,83],"paper,":[56],"we":[57,85],"analyze":[58],"quality":[60],"five":[62],"representative":[63],"sampling":[64],"algorithms":[65],"how":[67],"well":[68],"they":[69],"preserve":[70],"graph":[71],"structure,":[72],"bisimulation":[74,94],"structure":[75],"particular.":[79],"As":[80],"part":[81],"study,":[84],"also":[86],"develop":[87],"new":[89,107],"scalable":[90],"algorithm":[91,108],"for":[92],"computing":[93],"partitions":[95],"massive":[97],"graphs.":[98],"We":[99],"empirically":[100],"demonstrate":[101],"superior":[103],"performance":[104],"our":[106],"both":[110],"sequential":[111],"distributed":[113],"settings.":[114]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}