A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm [Articol]
| dc.contributor.author | Ciubotaru, Constantin | en |
| dc.date.accessioned | 2025-10-08T11:33:31Z | |
| dc.date.issued | 2025 | |
| dc.description.abstract | An implementation of the Demoucron-Malgrange-Pertuiset (DMP) algorithm is proposed, based on specifying the notion of a segment (fragment, bridge) and developing an algorithm for calculating and updating the segments after each iteration using a depth-first search strategy (DFS). The algorithm also works for nonplanar undirected graphs by finally constructing a planar subgraph and displaying the list of segments that cannot be embedded, so as they generate edge intersections when drawing. | en |
| dc.description.sponsorship | The project SIBIA 011301 has supported part of the research for this paper. | en |
| dc.identifier.citation | CIUBOTARU, Constantin. A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm. Computer Science Journal of Moldova. 2025, vol. 33, nr. 2(98), pp. 219-242. ISSN (print) 1561-4042; ISSN (online) 2587-4330. Disponibil: https://doi.org/10.56415/csjm.v33.11 | en |
| dc.identifier.issn | 1561-4042 | |
| dc.identifier.issn | 2587-4330 | |
| dc.identifier.uri | https://msuir.usm.md/handle/123456789/18872 | |
| dc.identifier.uri | https://doi.org/10.56415/csjm.v33.11 | |
| dc.language.iso | en | |
| dc.subject | biconnected graph | en |
| dc.subject | DM P algorithm | en |
| dc.subject | segment | en |
| dc.subject | face | en |
| dc.subject | segments/graphs embedding | en |
| dc.subject | segments/faces update | en |
| dc.title | A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm [Articol] | en |
| dc.type | Article |