Szczegóły publikacji
Opis bibliograficzny
Graph grammar based on similarity and conformity graphs / Artur BASIURA, Adam SĘDZIWY // W: Computational Science – ICCS 2026 workshops : 26th International Conference : Hamburg, Germany, June 29–July 1, 2026 : proceedings , Pt. 2 / eds. Maciej Paszynski, Amanda S. Barnard, Yongjie Jessica Zhang. — Cham : Springer, cop. 2026. — ( Lecture Notes in Computer Science ; ISSN 0302-9743 ; LNCS 16787 ). — ISBN: 978-3-032-29908-6; e-ISBN: 978-3-032-29909-3. — S. 175–189. — Bibliogr., Abstr. — Publikacja dostępna online od: 2026-06-28
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 168913 |
|---|---|
| Data dodania do BaDAP | 2026-08-31 |
| DOI | 10.1007/978-3-032-29909-3_13 |
| Rok publikacji | 2026 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Springer |
| Konferencja | International Conference on Computational Science 2026 |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
Public lighting retrofit planning requires computationally efficient yet standards-aware methods. This paper extends previous work on similarity and conformity graphs by introducing a formal graph-grammar framework for estimating the minimum achievable installed power in outdoor lighting networks under CEN 13201. The grammar defines transformations from a base infrastructure graph to derived similarity and conformity graphs. The similarity measure is computed in the SimilarityGraphCreation operation, stored on similarity edges, and then used for filtering, grouping, and result propagation, enabling fast estimation and what-if analysis. The framework is validated on a real retrofit project in Kraków, Poland, covering 3,741 lamps. The results show that the number of explicitly calculated segments can be reduced from 602 to 9–235, while richer similarity measures produce estimates close to the reference solution.
