乐胖代购免代理版

{"id":"https://openalex.org/W4378191615","doi":"https://doi.org/10.1109/synasc57785.2022.00039","title":"An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*","display_name":"An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*","publication_year":2022,"publication_date":"2022-09-01","ids":{"openalex":"https://openalex.org/W4378191615","doi":"https://doi.org/10.1109/synasc57785.2022.00039"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc57785.2022.00039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5068858870","display_name":"Zolt\u00e1n Tasn\u00e1di","orcid":null},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n Tasn\u00e1di","raw_affiliation_strings":["Babeş-Bolyai University,Faculty of Mathematics and Computer Science,Cluj-Napoca,Romania"],"affiliations":[{"raw_affiliation_string":"Babeş-Bolyai University,Faculty of Mathematics and Computer Science,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079153190","display_name":"No\u00e9mi Gask\u00f3","orcid":"https://orcid.org/0000-0002-3915-8986"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"No\u00e9mi Gask\u00f3","raw_affiliation_strings":["Babeş-Bolyai University,Faculty of Mathematics and Computer Science,Cluj-Napoca,Romania"],"affiliations":[{"raw_affiliation_string":"Babeş-Bolyai University,Faculty of Mathematics and Computer Science,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.386,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.570979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":76},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9904,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9904,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9902,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9882,"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/ant-colony","display_name":"Ant colony","score":0.6165553},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.59460616},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4969354},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.45293573},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.43643814}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7507002},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.68254995},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.6165553},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.59460616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5761927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5553434},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5402327},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4969354},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.45293573},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44334435},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.43643814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42635682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38856366},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21834496},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.10376617},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc57785.2022.00039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1502940150","https://openalex.org/W1604983895","https://openalex.org/W1888358353","https://openalex.org/W1910515323","https://openalex.org/W1983887603","https://openalex.org/W2036836182","https://openalex.org/W2037016941","https://openalex.org/W2046706749","https://openalex.org/W2047923585","https://openalex.org/W2051109346","https://openalex.org/W2067583942","https://openalex.org/W2153952206","https://openalex.org/W2171211995","https://openalex.org/W2408452789","https://openalex.org/W2583892328","https://openalex.org/W2792824988","https://openalex.org/W2962753098","https://openalex.org/W3095002479","https://openalex.org/W3102641634","https://openalex.org/W4312626775"],"related_works":["https://openalex.org/W4381707488","https://openalex.org/W4300575715","https://openalex.org/W3008959778","https://openalex.org/W2789636091","https://openalex.org/W2575141006","https://openalex.org/W2288163449","https://openalex.org/W2282273380","https://openalex.org/W2032950096","https://openalex.org/W176100319","https://openalex.org/W1533352539"],"abstract_inverted_index":{"The":[0],"densest":[1],"k-subgraph":[2],"problem":[3,12],"is":[4,34],"a":[5,17,24],"relaxation":[6],"of":[7,15,27,49],"the":[8,45,50],"well-known":[9],"maximum":[10,25],"clique":[11],"and":[13,23,47],"consists":[14],"finding":[16],"subgraph":[18],"with":[19],"exactly":[20],"k":[21],"nodes":[22],"number":[26],"edges.":[28],"An":[29],"ant":[30],"colony":[31],"optimisation-based":[32],"approach":[33],"proposed":[35,51],"to":[36],"solve":[37],"this":[38],"combinatorial":[39],"optimisation":[40],"problem.":[41],"Numerical":[42],"experiments":[43],"show":[44],"effectiveness":[46],"potential":[48],"approach.":[52]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4378191615","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-01-21T19:24:04.607692","created_date":"2023-05-26"}