Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm
Authors: Ciubotaru Constantin
Keywords: biconnected graph, $DMP$ algorithm, segment, face, segments/graphs embedding, segments/faces update.
– 1.79 Mb
Keywords: biconnected graph, $DMP$ algorithm, segment, face, segments/graphs embedding, segments/faces update.
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.ORCID: https://orcid.org/0009-0005-8896-0966
Moldova State University,
Vladimir Andrunachievici Institute of Mathematics and Computer Science
E-mail: ,
Moldova State University,
Vladimir Andrunachievici Institute of Mathematics and Computer Science
E-mail: ,
DOI
https://doi.org/10.56415/csjm.v33.11Fulltext
– 1.79 Mb
Contents
- Enhanced Green Accelerated Hoeffding Trees for Improved Data Stream Classification
- Enhancing Gait Recognition with Attention-Based Spatial-Temporal Deep Learning: The GaitDeep Framework
- A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm
- Automation of PostOCR error correction in the digitization of historical texts
- Feature-Level Decomposition of Text Complexity: Cross-Domain Empirical Evidence
