EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

Applying Demoucron-Malgrange-Pertuiset algorithm to build planar subgraphs

Constantin Ciubotaru

Computer Science Journal of Moldova · 2026-11 · 34 (2) · 305-320

DOI: 10.56415/csjm.v34.14 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computer Science Journal of Moldova, 2026-11. Verfasst von Constantin Ciubotaru. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An application of the modified Demoucron-Malgrange-Pertuiset algorithm (MDMP) is proposed to build planar subgraphs for biconnected graphs. Variants of planar subgraphs are extracted by applying the MDMP algorithm to several well-known graphs, which are non-planar and have a well-determined skewness number sk(G).

Zitieren

APA

Ciubotaru, C. (2026). Applying Demoucron-Malgrange-Pertuiset algorithm to build planar subgraphs. Computer Science Journal of Moldova, 34(2), 305-320. https://doi.org/10.56415/csjm.v34.14

Vancouver

Ciubotaru C. Applying Demoucron-Malgrange-Pertuiset algorithm to build planar subgraphs. Computer Science Journal of Moldova. 2026;34(2):305-320. doi:10.56415/csjm.v34.14

BibTeX
@article{Ciubotaru2026,
  author = {Ciubotaru, Constantin},
  title = {Applying Demoucron-Malgrange-Pertuiset algorithm to build planar subgraphs},
  journal = {Computer Science Journal of Moldova},
  year = {2026},
  volume = {34},
  number = {2},
  pages = {305--320},
  doi = {10.56415/csjm.v34.14}
}
Kostenlos starten →