Convex grid drawings of planar graphs with constant edge-vertex resolution Article Swipe
Michael A. Bekos
,
Martin Gronemann
,
Fabrizio Montecchiani
,
Antonios Symvonis
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.1016/j.tcs.2023.114290
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.1016/j.tcs.2023.114290
In this work, we continue the study of the area required for convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motivated by applications, such as graph editors, we additionally require the obtained drawings to have bounded edge-vertex resolution, that is, the closest distance between a vertex and any non-incident edge in the drawing is lower bounded by a constant that does not depend on the size of the graph. We present a drawing algorithm that takes as input a 3-connected plane graph with n vertices and f internal faces, and computes a convex straight-line drawing with edge-vertex resolution at least 12 on an integer grid of size (n−2+a)×(n−2+a), where a=min{n−3,f}. Our result improves the previously best-known area bound of (3n−7)×(3n−7)/2 by Chrobak, Goodrich and Tamassia.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1016/j.tcs.2023.114290
- OA Status
- hybrid
- References
- 41
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4388487112
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4388487112Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1016/j.tcs.2023.114290Digital Object Identifier
- Title
-
Convex grid drawings of planar graphs with constant edge-vertex resolutionWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-11-08Full publication date if available
- Authors
-
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios SymvonisList of authors in order
- Landing page
-
https://doi.org/10.1016/j.tcs.2023.114290Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
hybridOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1016/j.tcs.2023.114290Direct OA link when available
- Concepts
-
Combinatorics, Vertex (graph theory), Planar graph, Mathematics, Regular polygon, Bounded function, Grid, Graph drawing, Graph, Discrete mathematics, Geometry, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
41Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4388487112 |
|---|---|
| doi | https://doi.org/10.1016/j.tcs.2023.114290 |
| ids.doi | https://doi.org/10.1016/j.tcs.2023.114290 |
| ids.openalex | https://openalex.org/W4388487112 |
| fwci | 0.0 |
| type | article |
| title | Convex grid drawings of planar graphs with constant edge-vertex resolution |
| awards[0].id | https://openalex.org/G5197328000 |
| awards[0].funder_id | https://openalex.org/F4320321873 |
| awards[0].display_name | |
| awards[0].funder_award_id | 2022ME9Z78 |
| awards[0].funder_display_name | Ministero dell’Istruzione, dell’Università e della Ricerca |
| biblio.issue | |
| biblio.volume | 982 |
| biblio.last_page | 114290 |
| biblio.first_page | 114290 |
| topics[0].id | https://openalex.org/T10996 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9995999932289124 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1704 |
| topics[0].subfield.display_name | Computer Graphics and Computer-Aided Design |
| topics[0].display_name | Computational Geometry and Mesh Generation |
| topics[1].id | https://openalex.org/T12923 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9925000071525574 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Digital Image Processing Techniques |
| topics[2].id | https://openalex.org/T11269 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9854999780654907 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Algorithms and Data Compression |
| funders[0].id | https://openalex.org/F4320321873 |
| funders[0].ror | https://ror.org/0166hxq48 |
| funders[0].display_name | Ministero dell’Istruzione, dell’Università e della Ricerca |
| funders[1].id | https://openalex.org/F4320331528 |
| funders[1].ror | |
| funders[1].display_name | Ministero dell'Università e della Ricerca |
| is_xpac | False |
| apc_list.value | 2690 |
| apc_list.currency | USD |
| apc_list.value_usd | 2690 |
| apc_paid.value | 2690 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 2690 |
| concepts[0].id | https://openalex.org/C114614502 |
| concepts[0].level | 1 |
| concepts[0].score | 0.7786355018615723 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[0].display_name | Combinatorics |
| concepts[1].id | https://openalex.org/C80899671 |
| concepts[1].level | 3 |
| concepts[1].score | 0.6308275461196899 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1304193 |
| concepts[1].display_name | Vertex (graph theory) |
| concepts[2].id | https://openalex.org/C101837359 |
| concepts[2].level | 3 |
| concepts[2].score | 0.6194319128990173 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q547823 |
| concepts[2].display_name | Planar graph |
| concepts[3].id | https://openalex.org/C33923547 |
| concepts[3].level | 0 |
| concepts[3].score | 0.5936262607574463 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[3].display_name | Mathematics |
| concepts[4].id | https://openalex.org/C112680207 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5511373281478882 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q714886 |
| concepts[4].display_name | Regular polygon |
| concepts[5].id | https://openalex.org/C34388435 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4625595808029175 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q2267362 |
| concepts[5].display_name | Bounded function |
| concepts[6].id | https://openalex.org/C187691185 |
| concepts[6].level | 2 |
| concepts[6].score | 0.45760205388069153 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q2020720 |
| concepts[6].display_name | Grid |
| concepts[7].id | https://openalex.org/C112953755 |
| concepts[7].level | 3 |
| concepts[7].score | 0.4396063983440399 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q739462 |
| concepts[7].display_name | Graph drawing |
| concepts[8].id | https://openalex.org/C132525143 |
| concepts[8].level | 2 |
| concepts[8].score | 0.371057391166687 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[8].display_name | Graph |
| concepts[9].id | https://openalex.org/C118615104 |
| concepts[9].level | 1 |
| concepts[9].score | 0.3574444055557251 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[9].display_name | Discrete mathematics |
| concepts[10].id | https://openalex.org/C2524010 |
| concepts[10].level | 1 |
| concepts[10].score | 0.258462131023407 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[10].display_name | Geometry |
| concepts[11].id | https://openalex.org/C134306372 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[11].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/combinatorics |
| keywords[0].score | 0.7786355018615723 |
| keywords[0].display_name | Combinatorics |
| keywords[1].id | https://openalex.org/keywords/vertex |
| keywords[1].score | 0.6308275461196899 |
| keywords[1].display_name | Vertex (graph theory) |
| keywords[2].id | https://openalex.org/keywords/planar-graph |
| keywords[2].score | 0.6194319128990173 |
| keywords[2].display_name | Planar graph |
| keywords[3].id | https://openalex.org/keywords/mathematics |
| keywords[3].score | 0.5936262607574463 |
| keywords[3].display_name | Mathematics |
| keywords[4].id | https://openalex.org/keywords/regular-polygon |
| keywords[4].score | 0.5511373281478882 |
| keywords[4].display_name | Regular polygon |
| keywords[5].id | https://openalex.org/keywords/bounded-function |
| keywords[5].score | 0.4625595808029175 |
| keywords[5].display_name | Bounded function |
| keywords[6].id | https://openalex.org/keywords/grid |
| keywords[6].score | 0.45760205388069153 |
| keywords[6].display_name | Grid |
| keywords[7].id | https://openalex.org/keywords/graph-drawing |
| keywords[7].score | 0.4396063983440399 |
| keywords[7].display_name | Graph drawing |
| keywords[8].id | https://openalex.org/keywords/graph |
| keywords[8].score | 0.371057391166687 |
| keywords[8].display_name | Graph |
| keywords[9].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[9].score | 0.3574444055557251 |
| keywords[9].display_name | Discrete mathematics |
| keywords[10].id | https://openalex.org/keywords/geometry |
| keywords[10].score | 0.258462131023407 |
| keywords[10].display_name | Geometry |
| language | en |
| locations[0].id | doi:10.1016/j.tcs.2023.114290 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S90727058 |
| locations[0].source.issn | 0304-3975, 1879-2294 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0304-3975 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Theoretical Computer Science |
| locations[0].source.host_organization | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_name | Elsevier BV |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_lineage_names | Elsevier BV |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Theoretical Computer Science |
| locations[0].landing_page_url | https://doi.org/10.1016/j.tcs.2023.114290 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5006472576 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-3414-7444 |
| authorships[0].author.display_name | Michael A. Bekos |
| authorships[0].countries | GR |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I194019607 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Mathematics, University of Ioannina, Ioannina, Greece |
| authorships[0].institutions[0].id | https://openalex.org/I194019607 |
| authorships[0].institutions[0].ror | https://ror.org/01qg3j183 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I194019607 |
| authorships[0].institutions[0].country_code | GR |
| authorships[0].institutions[0].display_name | University of Ioannina |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Michael A. Bekos |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Mathematics, University of Ioannina, Ioannina, Greece |
| authorships[1].author.id | https://openalex.org/A5080178526 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-2565-090X |
| authorships[1].author.display_name | Martin Gronemann |
| authorships[1].countries | AT |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I145847075 |
| authorships[1].affiliations[0].raw_affiliation_string | Algorithms and Complexity Group, TU Wien, Vienna, Austria |
| authorships[1].institutions[0].id | https://openalex.org/I145847075 |
| authorships[1].institutions[0].ror | https://ror.org/04d836q62 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I145847075 |
| authorships[1].institutions[0].country_code | AT |
| authorships[1].institutions[0].display_name | TU Wien |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Martin Gronemann |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Algorithms and Complexity Group, TU Wien, Vienna, Austria |
| authorships[2].author.id | https://openalex.org/A5006763389 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-0543-8912 |
| authorships[2].author.display_name | Fabrizio Montecchiani |
| authorships[2].countries | IT |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I27483092 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Engineering, University of Perugia, Perugia, Italy |
| authorships[2].institutions[0].id | https://openalex.org/I27483092 |
| authorships[2].institutions[0].ror | https://ror.org/00x27da85 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I27483092 |
| authorships[2].institutions[0].country_code | IT |
| authorships[2].institutions[0].display_name | University of Perugia |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Fabrizio Montecchiani |
| authorships[2].is_corresponding | True |
| authorships[2].raw_affiliation_strings | Department of Engineering, University of Perugia, Perugia, Italy |
| authorships[3].author.id | https://openalex.org/A5011976306 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-0280-741X |
| authorships[3].author.display_name | Antonios Symvonis |
| authorships[3].countries | GR |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I174458059 |
| authorships[3].affiliations[0].raw_affiliation_string | School of Applied Mathematical & Physical Sciences, National Technical University of Athens, Athens, Greece |
| authorships[3].institutions[0].id | https://openalex.org/I174458059 |
| authorships[3].institutions[0].ror | https://ror.org/03cx6bg69 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I174458059 |
| authorships[3].institutions[0].country_code | GR |
| authorships[3].institutions[0].display_name | National Technical University of Athens |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Antonios Symvonis |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | School of Applied Mathematical & Physical Sciences, National Technical University of Athens, Athens, Greece |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1016/j.tcs.2023.114290 |
| open_access.oa_status | hybrid |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Convex grid drawings of planar graphs with constant edge-vertex resolution |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10996 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9995999932289124 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1704 |
| primary_topic.subfield.display_name | Computer Graphics and Computer-Aided Design |
| primary_topic.display_name | Computational Geometry and Mesh Generation |
| related_works | https://openalex.org/W1793337513, https://openalex.org/W2210665824, https://openalex.org/W2296389180, https://openalex.org/W2073023540, https://openalex.org/W2048639803, https://openalex.org/W4287272854, https://openalex.org/W2604486243, https://openalex.org/W2470646738, https://openalex.org/W130561602, https://openalex.org/W2337656972 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1016/j.tcs.2023.114290 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S90727058 |
| best_oa_location.source.issn | 0304-3975, 1879-2294 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 0304-3975 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Theoretical Computer Science |
| best_oa_location.source.host_organization | https://openalex.org/P4310320990 |
| best_oa_location.source.host_organization_name | Elsevier BV |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| best_oa_location.source.host_organization_lineage_names | Elsevier BV |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Theoretical Computer Science |
| best_oa_location.landing_page_url | https://doi.org/10.1016/j.tcs.2023.114290 |
| primary_location.id | doi:10.1016/j.tcs.2023.114290 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S90727058 |
| primary_location.source.issn | 0304-3975, 1879-2294 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0304-3975 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Theoretical Computer Science |
| primary_location.source.host_organization | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_name | Elsevier BV |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_lineage_names | Elsevier BV |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Theoretical Computer Science |
| primary_location.landing_page_url | https://doi.org/10.1016/j.tcs.2023.114290 |
| publication_date | 2023-11-08 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W6636502770, https://openalex.org/W2525196242, https://openalex.org/W2114443956, https://openalex.org/W2045825801, https://openalex.org/W3161337319, https://openalex.org/W6810546276, https://openalex.org/W6842766113, https://openalex.org/W6628847720, https://openalex.org/W6735902061, https://openalex.org/W2057600466, https://openalex.org/W202496218, https://openalex.org/W2010758649, https://openalex.org/W6665377039, https://openalex.org/W2120892678, https://openalex.org/W2038318850, https://openalex.org/W2066423045, https://openalex.org/W159864094, https://openalex.org/W2013491730, https://openalex.org/W1999775539, https://openalex.org/W1574212655, https://openalex.org/W2498084162, https://openalex.org/W2062622930, https://openalex.org/W2045870980, https://openalex.org/W1997058665, https://openalex.org/W2013871179, https://openalex.org/W2090443820, https://openalex.org/W6823485549, https://openalex.org/W6656140324, https://openalex.org/W2060766314, https://openalex.org/W6645454059, https://openalex.org/W4240983959, https://openalex.org/W1998192166, https://openalex.org/W2082388593, https://openalex.org/W1968439658, https://openalex.org/W6608186781, https://openalex.org/W6746275862, https://openalex.org/W6634292197, https://openalex.org/W2772465410, https://openalex.org/W572281182, https://openalex.org/W4205436938, https://openalex.org/W634834491 |
| referenced_works_count | 41 |
| abstract_inverted_index.a | 53, 66, 80, 87, 100 |
| abstract_inverted_index.f | 95 |
| abstract_inverted_index.n | 92 |
| abstract_inverted_index.12 | 109 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.We | 78 |
| abstract_inverted_index.an | 111 |
| abstract_inverted_index.as | 33, 85 |
| abstract_inverted_index.at | 107 |
| abstract_inverted_index.by | 30, 65, 129 |
| abstract_inverted_index.in | 25, 59 |
| abstract_inverted_index.is | 62 |
| abstract_inverted_index.of | 7, 16, 75, 114, 127 |
| abstract_inverted_index.on | 72, 110 |
| abstract_inverted_index.to | 42 |
| abstract_inverted_index.we | 3, 36 |
| abstract_inverted_index.Our | 119 |
| abstract_inverted_index.and | 55, 94, 98, 132 |
| abstract_inverted_index.any | 56 |
| abstract_inverted_index.for | 11 |
| abstract_inverted_index.has | 21 |
| abstract_inverted_index.is, | 48 |
| abstract_inverted_index.not | 70 |
| abstract_inverted_index.the | 5, 8, 26, 39, 49, 60, 73, 76, 122 |
| abstract_inverted_index.area | 9, 125 |
| abstract_inverted_index.been | 22 |
| abstract_inverted_index.does | 69 |
| abstract_inverted_index.edge | 58 |
| abstract_inverted_index.grid | 14, 113 |
| abstract_inverted_index.have | 43 |
| abstract_inverted_index.last | 27 |
| abstract_inverted_index.size | 74, 115 |
| abstract_inverted_index.such | 32 |
| abstract_inverted_index.that | 47, 68, 83 |
| abstract_inverted_index.this | 1 |
| abstract_inverted_index.with | 91, 104 |
| abstract_inverted_index.bound | 126 |
| abstract_inverted_index.graph | 34, 90 |
| abstract_inverted_index.input | 86 |
| abstract_inverted_index.least | 108 |
| abstract_inverted_index.lower | 63 |
| abstract_inverted_index.plane | 18, 89 |
| abstract_inverted_index.study | 6 |
| abstract_inverted_index.takes | 84 |
| abstract_inverted_index.where | 117 |
| abstract_inverted_index.which | 20 |
| abstract_inverted_index.work, | 2 |
| abstract_inverted_index.convex | 12, 101 |
| abstract_inverted_index.depend | 71 |
| abstract_inverted_index.faces, | 97 |
| abstract_inverted_index.graph. | 77 |
| abstract_inverted_index.result | 120 |
| abstract_inverted_index.vertex | 54 |
| abstract_inverted_index.between | 52 |
| abstract_inverted_index.bounded | 44, 64 |
| abstract_inverted_index.closest | 50 |
| abstract_inverted_index.drawing | 61, 81, 103 |
| abstract_inverted_index.graphs, | 19 |
| abstract_inverted_index.integer | 112 |
| abstract_inverted_index.present | 79 |
| abstract_inverted_index.require | 38 |
| abstract_inverted_index.Chrobak, | 130 |
| abstract_inverted_index.Goodrich | 131 |
| abstract_inverted_index.computes | 99 |
| abstract_inverted_index.constant | 67 |
| abstract_inverted_index.continue | 4 |
| abstract_inverted_index.decades. | 28 |
| abstract_inverted_index.distance | 51 |
| abstract_inverted_index.drawings | 15, 41 |
| abstract_inverted_index.editors, | 35 |
| abstract_inverted_index.improves | 121 |
| abstract_inverted_index.internal | 96 |
| abstract_inverted_index.obtained | 40 |
| abstract_inverted_index.required | 10 |
| abstract_inverted_index.vertices | 93 |
| abstract_inverted_index.Motivated | 29 |
| abstract_inverted_index.Tamassia. | 133 |
| abstract_inverted_index.algorithm | 82 |
| abstract_inverted_index.best-known | 124 |
| abstract_inverted_index.previously | 123 |
| abstract_inverted_index.resolution | 106 |
| abstract_inverted_index.3-connected | 17, 88 |
| abstract_inverted_index.edge-vertex | 45, 105 |
| abstract_inverted_index.intensively | 23 |
| abstract_inverted_index.resolution, | 46 |
| abstract_inverted_index.additionally | 37 |
| abstract_inverted_index.investigated | 24 |
| abstract_inverted_index.non-incident | 57 |
| abstract_inverted_index.applications, | 31 |
| abstract_inverted_index.straight-line | 13, 102 |
| abstract_inverted_index.a=min{n−3,f}. | 118 |
| abstract_inverted_index.(3n−7)×(3n−7)/2 | 128 |
| abstract_inverted_index.(n−2+a)×(n−2+a), | 116 |
| cited_by_percentile_year | |
| corresponding_author_ids | https://openalex.org/A5006763389 |
| countries_distinct_count | 3 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I27483092 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/11 |
| sustainable_development_goals[0].score | 0.5299999713897705 |
| sustainable_development_goals[0].display_name | Sustainable cities and communities |
| citation_normalized_percentile.value | 0.36419001 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |