A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm

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 als...

Full description

Saved in:

Bibliographic Details
Published in:	Computer science journal of Moldova Vol. 33; no. 2(98); pp. 219 - 242
Main Author:	Ciubotaru, Constantin
Format:	Journal Article
Language:	English
Published:	Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.09.2025
Subjects:	biconnected graph dmp$ algorithm face segment segments/faces update segments/graphs embedding
ISSN:	1561-4042, 1561-4042, 2587-4330
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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 drawin
ISSN:	1561-4042 1561-4042 2587-4330
DOI:	10.56415/csjm.v33.11