A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks Article Swipe
Shih-Shun Kao
,
Ralf Klasing
,
Ling-Ju Hung
,
Sun‐Yuan Hsieh
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1007/978-3-030-93176-6_22
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1007/978-3-030-93176-6_22
Related Topics
Concepts
Spanning tree
Computer science
sort
Vertex (graph theory)
Algorithm
Time complexity
Dimension (graph theory)
Sorting
Minimum spanning tree
Sorting network
Function (biology)
Combinatorics
Graph
Sorting algorithm
Mathematics
Theoretical computer science
Biology
Evolutionary biology
Information retrieval
Metadata
- Type
- book-chapter
- Language
- en
- Landing Page
- https://doi.org/10.1007/978-3-030-93176-6_22
- OA Status
- green
- Cited By
- 1
- References
- 37
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4205818074
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4205818074Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1007/978-3-030-93176-6_22Digital Object Identifier
- Title
-
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort NetworksWork title
- Type
-
book-chapterOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-01-01Full publication date if available
- Authors
-
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun‐Yuan HsiehList of authors in order
- Landing page
-
https://doi.org/10.1007/978-3-030-93176-6_22Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hal.science/hal-03820079Direct OA link when available
- Concepts
-
Spanning tree, Computer science, sort, Vertex (graph theory), Algorithm, Time complexity, Dimension (graph theory), Sorting, Minimum spanning tree, Sorting network, Function (biology), Combinatorics, Graph, Sorting algorithm, Mathematics, Theoretical computer science, Biology, Evolutionary biology, Information retrievalTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2022: 1Per-year citation counts (last 5 years)
- References (count)
-
37Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4205818074 |
|---|---|
| doi | https://doi.org/10.1007/978-3-030-93176-6_22 |
| ids.doi | https://doi.org/10.1007/978-3-030-93176-6_22 |
| ids.openalex | https://openalex.org/W4205818074 |
| fwci | 0.57315797 |
| type | book-chapter |
| title | A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 264 |
| biblio.first_page | 252 |
| topics[0].id | https://openalex.org/T10829 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Interconnection Networks and Systems |
| topics[1].id | https://openalex.org/T10374 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9986000061035156 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Advanced Graph Theory Research |
| topics[2].id | https://openalex.org/T12541 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.995199978351593 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1703 |
| topics[2].subfield.display_name | Computational Theory and Mathematics |
| topics[2].display_name | Graph Labeling and Dimension Problems |
| is_xpac | False |
| apc_list.value | 5000 |
| apc_list.currency | EUR |
| apc_list.value_usd | 5392 |
| apc_paid | |
| concepts[0].id | https://openalex.org/C64331007 |
| concepts[0].level | 2 |
| concepts[0].score | 0.647170901298523 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q831672 |
| concepts[0].display_name | Spanning tree |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6187999844551086 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C88548561 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6129768490791321 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q347599 |
| concepts[2].display_name | sort |
| concepts[3].id | https://openalex.org/C80899671 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5147311687469482 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1304193 |
| concepts[3].display_name | Vertex (graph theory) |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.47954580187797546 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C311688 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4659572243690491 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q2393193 |
| concepts[5].display_name | Time complexity |
| concepts[6].id | https://openalex.org/C33676613 |
| concepts[6].level | 2 |
| concepts[6].score | 0.44505253434181213 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q13415176 |
| concepts[6].display_name | Dimension (graph theory) |
| concepts[7].id | https://openalex.org/C111696304 |
| concepts[7].level | 2 |
| concepts[7].score | 0.44259533286094666 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q2303697 |
| concepts[7].display_name | Sorting |
| concepts[8].id | https://openalex.org/C13743678 |
| concepts[8].level | 2 |
| concepts[8].score | 0.42423564195632935 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q240464 |
| concepts[8].display_name | Minimum spanning tree |
| concepts[9].id | https://openalex.org/C64540648 |
| concepts[9].level | 4 |
| concepts[9].score | 0.421022891998291 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q646477 |
| concepts[9].display_name | Sorting network |
| concepts[10].id | https://openalex.org/C14036430 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4104726314544678 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q3736076 |
| concepts[10].display_name | Function (biology) |
| concepts[11].id | https://openalex.org/C114614502 |
| concepts[11].level | 1 |
| concepts[11].score | 0.39664706587791443 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[11].display_name | Combinatorics |
| concepts[12].id | https://openalex.org/C132525143 |
| concepts[12].level | 2 |
| concepts[12].score | 0.3613344132900238 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[12].display_name | Graph |
| concepts[13].id | https://openalex.org/C108094655 |
| concepts[13].level | 3 |
| concepts[13].score | 0.35920390486717224 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q181593 |
| concepts[13].display_name | Sorting algorithm |
| concepts[14].id | https://openalex.org/C33923547 |
| concepts[14].level | 0 |
| concepts[14].score | 0.3249134421348572 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[14].display_name | Mathematics |
| concepts[15].id | https://openalex.org/C80444323 |
| concepts[15].level | 1 |
| concepts[15].score | 0.32102811336517334 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[15].display_name | Theoretical computer science |
| concepts[16].id | https://openalex.org/C86803240 |
| concepts[16].level | 0 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[16].display_name | Biology |
| concepts[17].id | https://openalex.org/C78458016 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q840400 |
| concepts[17].display_name | Evolutionary biology |
| concepts[18].id | https://openalex.org/C23123220 |
| concepts[18].level | 1 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q816826 |
| concepts[18].display_name | Information retrieval |
| keywords[0].id | https://openalex.org/keywords/spanning-tree |
| keywords[0].score | 0.647170901298523 |
| keywords[0].display_name | Spanning tree |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6187999844551086 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/sort |
| keywords[2].score | 0.6129768490791321 |
| keywords[2].display_name | sort |
| keywords[3].id | https://openalex.org/keywords/vertex |
| keywords[3].score | 0.5147311687469482 |
| keywords[3].display_name | Vertex (graph theory) |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.47954580187797546 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/time-complexity |
| keywords[5].score | 0.4659572243690491 |
| keywords[5].display_name | Time complexity |
| keywords[6].id | https://openalex.org/keywords/dimension |
| keywords[6].score | 0.44505253434181213 |
| keywords[6].display_name | Dimension (graph theory) |
| keywords[7].id | https://openalex.org/keywords/sorting |
| keywords[7].score | 0.44259533286094666 |
| keywords[7].display_name | Sorting |
| keywords[8].id | https://openalex.org/keywords/minimum-spanning-tree |
| keywords[8].score | 0.42423564195632935 |
| keywords[8].display_name | Minimum spanning tree |
| keywords[9].id | https://openalex.org/keywords/sorting-network |
| keywords[9].score | 0.421022891998291 |
| keywords[9].display_name | Sorting network |
| keywords[10].id | https://openalex.org/keywords/function |
| keywords[10].score | 0.4104726314544678 |
| keywords[10].display_name | Function (biology) |
| keywords[11].id | https://openalex.org/keywords/combinatorics |
| keywords[11].score | 0.39664706587791443 |
| keywords[11].display_name | Combinatorics |
| keywords[12].id | https://openalex.org/keywords/graph |
| keywords[12].score | 0.3613344132900238 |
| keywords[12].display_name | Graph |
| keywords[13].id | https://openalex.org/keywords/sorting-algorithm |
| keywords[13].score | 0.35920390486717224 |
| keywords[13].display_name | Sorting algorithm |
| keywords[14].id | https://openalex.org/keywords/mathematics |
| keywords[14].score | 0.3249134421348572 |
| keywords[14].display_name | Mathematics |
| keywords[15].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[15].score | 0.32102811336517334 |
| keywords[15].display_name | Theoretical computer science |
| language | en |
| locations[0].id | doi:10.1007/978-3-030-93176-6_22 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S106296714 |
| locations[0].source.issn | 0302-9743, 1611-3349 |
| locations[0].source.type | book series |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0302-9743 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Lecture notes in computer science |
| locations[0].source.host_organization | https://openalex.org/P4310319900 |
| locations[0].source.host_organization_name | Springer Science+Business Media |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| locations[0].source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | book-chapter |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Lecture Notes in Computer Science |
| locations[0].landing_page_url | https://doi.org/10.1007/978-3-030-93176-6_22 |
| locations[1].id | pmh:oai:HAL:hal-03820079v1 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306402512 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| locations[1].source.host_organization | https://openalex.org/I1294671590 |
| locations[1].source.host_organization_name | Centre National de la Recherche Scientifique |
| locations[1].source.host_organization_lineage | https://openalex.org/I1294671590 |
| locations[1].license | other-oa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | Conference papers |
| locations[1].license_id | https://openalex.org/licenses/other-oa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | AAIM 2021, Dec 2021, Dallas, United States. pp.252-264, ⟨10.1007/978-3-030-93176-6_22⟩ |
| locations[1].landing_page_url | https://hal.science/hal-03820079 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5045206789 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-7695-3535 |
| authorships[0].author.display_name | Shih-Shun Kao |
| authorships[0].countries | FR, TW |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I91807558 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[0].affiliations[1].institution_ids | https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210160189 |
| authorships[0].affiliations[1].raw_affiliation_string | CNRS, LaBRI, Université de Bordeaux, Talence, France |
| authorships[0].institutions[0].id | https://openalex.org/I1294671590 |
| authorships[0].institutions[0].ror | https://ror.org/02feahw73 |
| authorships[0].institutions[0].type | government |
| authorships[0].institutions[0].lineage | https://openalex.org/I1294671590 |
| authorships[0].institutions[0].country_code | FR |
| authorships[0].institutions[0].display_name | Centre National de la Recherche Scientifique |
| authorships[0].institutions[1].id | https://openalex.org/I4210160189 |
| authorships[0].institutions[1].ror | https://ror.org/054qv7y42 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I4210160189 |
| authorships[0].institutions[1].country_code | FR |
| authorships[0].institutions[1].display_name | Institut Polytechnique de Bordeaux |
| authorships[0].institutions[2].id | https://openalex.org/I4210142254 |
| authorships[0].institutions[2].ror | https://ror.org/03adqg323 |
| authorships[0].institutions[2].type | facility |
| authorships[0].institutions[2].lineage | https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210159245, https://openalex.org/I4210160189 |
| authorships[0].institutions[2].country_code | FR |
| authorships[0].institutions[2].display_name | Laboratoire Bordelais de Recherche en Informatique |
| authorships[0].institutions[3].id | https://openalex.org/I15057530 |
| authorships[0].institutions[3].ror | https://ror.org/057qpr032 |
| authorships[0].institutions[3].type | education |
| authorships[0].institutions[3].lineage | https://openalex.org/I15057530 |
| authorships[0].institutions[3].country_code | FR |
| authorships[0].institutions[3].display_name | Université de Bordeaux |
| authorships[0].institutions[4].id | https://openalex.org/I91807558 |
| authorships[0].institutions[4].ror | https://ror.org/01b8kcc49 |
| authorships[0].institutions[4].type | education |
| authorships[0].institutions[4].lineage | https://openalex.org/I91807558 |
| authorships[0].institutions[4].country_code | TW |
| authorships[0].institutions[4].display_name | National Cheng Kung University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Shih-Shun Kao |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | CNRS, LaBRI, Université de Bordeaux, Talence, France, Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[1].author.id | https://openalex.org/A5112786437 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Ralf Klasing |
| authorships[1].countries | FR |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210160189 |
| authorships[1].affiliations[0].raw_affiliation_string | CNRS, LaBRI, Université de Bordeaux, Talence, France |
| authorships[1].institutions[0].id | https://openalex.org/I1294671590 |
| authorships[1].institutions[0].ror | https://ror.org/02feahw73 |
| authorships[1].institutions[0].type | government |
| authorships[1].institutions[0].lineage | https://openalex.org/I1294671590 |
| authorships[1].institutions[0].country_code | FR |
| authorships[1].institutions[0].display_name | Centre National de la Recherche Scientifique |
| authorships[1].institutions[1].id | https://openalex.org/I4210160189 |
| authorships[1].institutions[1].ror | https://ror.org/054qv7y42 |
| authorships[1].institutions[1].type | education |
| authorships[1].institutions[1].lineage | https://openalex.org/I4210160189 |
| authorships[1].institutions[1].country_code | FR |
| authorships[1].institutions[1].display_name | Institut Polytechnique de Bordeaux |
| authorships[1].institutions[2].id | https://openalex.org/I4210142254 |
| authorships[1].institutions[2].ror | https://ror.org/03adqg323 |
| authorships[1].institutions[2].type | facility |
| authorships[1].institutions[2].lineage | https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210159245, https://openalex.org/I4210160189 |
| authorships[1].institutions[2].country_code | FR |
| authorships[1].institutions[2].display_name | Laboratoire Bordelais de Recherche en Informatique |
| authorships[1].institutions[3].id | https://openalex.org/I15057530 |
| authorships[1].institutions[3].ror | https://ror.org/057qpr032 |
| authorships[1].institutions[3].type | education |
| authorships[1].institutions[3].lineage | https://openalex.org/I15057530 |
| authorships[1].institutions[3].country_code | FR |
| authorships[1].institutions[3].display_name | Université de Bordeaux |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ralf Klasing |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | CNRS, LaBRI, Université de Bordeaux, Talence, France |
| authorships[2].author.id | https://openalex.org/A5007511094 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-5659-5507 |
| authorships[2].author.display_name | Ling-Ju Hung |
| authorships[2].countries | TW |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I43566213 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Creative Technologies and Product Design, National Taipei University of Business, Taoyuan, Taiwan |
| authorships[2].institutions[0].id | https://openalex.org/I43566213 |
| authorships[2].institutions[0].ror | https://ror.org/029hrv109 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I43566213 |
| authorships[2].institutions[0].country_code | TW |
| authorships[2].institutions[0].display_name | National Taipei University of Business |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Ling-Ju Hung |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Creative Technologies and Product Design, National Taipei University of Business, Taoyuan, Taiwan |
| authorships[3].author.id | https://openalex.org/A5103047340 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-4746-3179 |
| authorships[3].author.display_name | Sun‐Yuan Hsieh |
| authorships[3].countries | TW |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I91807558 |
| authorships[3].affiliations[0].raw_affiliation_string | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[3].affiliations[1].institution_ids | https://openalex.org/I91807558 |
| authorships[3].affiliations[1].raw_affiliation_string | Institute of Medical Informatics, National Cheng Kung University, Tainan, Taiwan |
| authorships[3].institutions[0].id | https://openalex.org/I91807558 |
| authorships[3].institutions[0].ror | https://ror.org/01b8kcc49 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I91807558 |
| authorships[3].institutions[0].country_code | TW |
| authorships[3].institutions[0].display_name | National Cheng Kung University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Sun-Yuan Hsieh |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, Institute of Medical Informatics, National Cheng Kung University, Tainan, Taiwan |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://hal.science/hal-03820079 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10829 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Interconnection Networks and Systems |
| related_works | https://openalex.org/W2418231958, https://openalex.org/W2099915933, https://openalex.org/W3116169590, https://openalex.org/W1703428550, https://openalex.org/W4380840098, https://openalex.org/W2044443696, https://openalex.org/W2503538928, https://openalex.org/W3101281637, https://openalex.org/W2390742649, https://openalex.org/W1561849181 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2022 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:HAL:hal-03820079v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402512 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| best_oa_location.source.host_organization | https://openalex.org/I1294671590 |
| best_oa_location.source.host_organization_name | Centre National de la Recherche Scientifique |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I1294671590 |
| best_oa_location.license | other-oa |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Conference papers |
| best_oa_location.license_id | https://openalex.org/licenses/other-oa |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | AAIM 2021, Dec 2021, Dallas, United States. pp.252-264, ⟨10.1007/978-3-030-93176-6_22⟩ |
| best_oa_location.landing_page_url | https://hal.science/hal-03820079 |
| primary_location.id | doi:10.1007/978-3-030-93176-6_22 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S106296714 |
| primary_location.source.issn | 0302-9743, 1611-3349 |
| primary_location.source.type | book series |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0302-9743 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Lecture notes in computer science |
| primary_location.source.host_organization | https://openalex.org/P4310319900 |
| primary_location.source.host_organization_name | Springer Science+Business Media |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| primary_location.source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | book-chapter |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Lecture Notes in Computer Science |
| primary_location.landing_page_url | https://doi.org/10.1007/978-3-030-93176-6_22 |
| publication_date | 2021-01-01 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W2104852618, https://openalex.org/W1977370680, https://openalex.org/W2560275761, https://openalex.org/W2345184394, https://openalex.org/W2998719837, https://openalex.org/W3163478546, https://openalex.org/W1971061054, https://openalex.org/W2015485656, https://openalex.org/W2159421784, https://openalex.org/W3089396898, https://openalex.org/W3034093661, https://openalex.org/W2022175859, https://openalex.org/W2953080657, https://openalex.org/W2006394420, https://openalex.org/W2024259395, https://openalex.org/W3048230596, https://openalex.org/W2040681998, https://openalex.org/W1997778928, https://openalex.org/W2941176923, https://openalex.org/W2927589906, https://openalex.org/W3027335499, https://openalex.org/W3023089654, https://openalex.org/W2077515067, https://openalex.org/W2096005292, https://openalex.org/W2079922756, https://openalex.org/W2035439570, https://openalex.org/W2118618518, https://openalex.org/W2084140489, https://openalex.org/W2154502231, https://openalex.org/W2128919165, https://openalex.org/W2092479763, https://openalex.org/W2095183018, https://openalex.org/W2076242490, https://openalex.org/W3120176239, https://openalex.org/W2079000395, https://openalex.org/W3035082877, https://openalex.org/W2097755092 |
| referenced_works_count | 37 |
| abstract_inverted_index | |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.69743978 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |