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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer science journal of Moldova Ročník 33; číslo 2(98); s. 219 - 242
Hlavný autor: Ciubotaru, Constantin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.09.2025
Predmet:
biconnected graph
dmp$ algorithm
face
segment
segments/faces update
segments/graphs embedding
ISSN:1561-4042, 1561-4042, 2587-4330
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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 drawin
AbstractList 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
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.
Author Ciubotaru, Constantin
Author_xml – sequence: 1
  givenname: Constantin
  orcidid: 0009-0005-8896-0966
  surname: Ciubotaru
  fullname: Ciubotaru, Constantin
BookMark eNpNkE1LAzEQhoNUsK3e_AF78-LWfDc5lvpVqOhBz2E2m9SU3U1JtoL-etdWxNMM7zs8MM8EjbrYOYQuCZ4JyYm4sXnbzj4YmxFygsZESFJyzOno336GJjlvMZaSKzpGy0WxizEVLXRXuUgOmvAFfYhdEX1x69q4tyl25RM0mwTdxpUvLvX7kF1fDFFMoX9vz9Gphya7i985RW_3d6_Lx3L9_LBaLtalpVr1pdO6UkCrymNPBVXYCgAnhLDWk3klFfaWOU88gGQ11U5Rb4daMs0VqWs2Rasjt46wNbsUWkifJkIwhyCmjYHUB9s4g7WvtOaScu85VRoId15rUDUTc0rIwLo-sob3ck7O__EINgeZ5kemGWSa4fwbPo5qfw
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.56415/csjm.v33.11
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1561-4042
2587-4330
EndPage 242
ExternalDocumentID oai_doaj_org_article_09fb994624ff4289a14ef99a8d357211
10_56415_csjm_v33_11
GroupedDBID 29F
2WC
5VS
AAKPC
AAYXX
ABDBF
ACIPV
ACUHS
ADBBV
AEGXH
ALMA_UNASSIGNED_HOLDINGS
AMVHM
BCNDV
C1A
CITATION
EOJEC
ESX
GROUPED_DOAJ
KQ8
MK~
ML~
OBODZ
OK1
OVT
RNS
TR2
TUS
ID FETCH-LOGICAL-c298t-e99b8a2bbf0f25280c5aae555ccf17b680fc3ef1faa63d29e82fc555639481dd3
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001572436700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1561-4042
IngestDate Fri Oct 03 12:50:54 EDT 2025
Sat Nov 29 07:27:50 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2(98)
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c298t-e99b8a2bbf0f25280c5aae555ccf17b680fc3ef1faa63d29e82fc555639481dd3
ORCID 0009-0005-8896-0966
OpenAccessLink https://doaj.org/article/09fb994624ff4289a14ef99a8d357211
PageCount 24
ParticipantIDs doaj_primary_oai_doaj_org_article_09fb994624ff4289a14ef99a8d357211
crossref_primary_10_56415_csjm_v33_11
PublicationCentury 2000
PublicationDate 2025-09-01
PublicationDateYYYYMMDD 2025-09-01
PublicationDate_xml – month: 09
  year: 2025
  text: 2025-09-01
  day: 01
PublicationDecade 2020
PublicationTitle Computer science journal of Moldova
PublicationYear 2025
Publisher Vladimir Andrunachievici Institute of Mathematics and Computer Science
Publisher_xml – name: Vladimir Andrunachievici Institute of Mathematics and Computer Science
SSID ssj0066482
Score 2.3020341
Snippet An implementation of the Demoucron-Malgrange-Pertuiset ($DMP$) algorithm is proposed, based on specifying the notion of a segment (fragment, bridge) and...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 219
SubjectTerms biconnected graph
dmp$ algorithm
face
segment
segments/faces update
segments/graphs embedding
Title A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm
URI https://doaj.org/article/09fb994624ff4289a14ef99a8d357211
Volume 33
WOSCitedRecordID wos001572436700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1561-4042
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0066482
  issn: 1561-4042
  databaseCode: DOA
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwFLRQxcDCN6J8yQOIyW3i2I49lkLFAFUHQN0ix7GhiCZVkvb3YzspKhMLY6wotu7Ffu-k5zsAru3-im0mlUgyohDBJkKSSG0fYyWUJc7Y9-a8PcXjMZ9OxWTD6sv1hDXywA1w_UCYVAjCMDHGlspChkQbISTPIurYizt9g1isyVRzBjNGvE2UJSeOIRHctLxTZtNVX1Wf894qinph-CsZbWj2--Qy2ge7bVUIB81qDsCWzg_B3tpxAbYb8AgMB3BRFCWcy_y2grbe-2qvUcLCwHttabydKEfP3lYof9doost6Oat0De1QUc7qj_kxeB09vAwfUWuDgBQWvEZaiJRLnKYmMJhiHigqpaaUKmXCOGU8MCrSJjRSsijDQnNsFHXCX06JJcuiE9DJi1yfAkgYyzQXQSozQdKAcR0qGmtCpQU2i3gX3KzxSBaN2kViWYLHLXG4JRY3Sxq64M6B9fOO06j2AzZySRu55K_Inf3HR87BDnaOvL7r6wJ06nKpL8G2WtWzqrzyP8U3MHa64w
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+poor+man%27s+realization+of+Demoucron-Malgrange-Pertuiset+algorithm&rft.jtitle=Computer+science+journal+of+Moldova&rft.au=Ciubotaru%2C+Constantin&rft.date=2025-09-01&rft.issn=1561-4042&rft.eissn=1561-4042&rft.volume=33&rft.issue=2%2898%29&rft.spage=219&rft.epage=242&rft_id=info:doi/10.56415%2Fcsjm.v33.11&rft.externalDBID=n%2Fa&rft.externalDocID=10_56415_csjm_v33_11
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1561-4042&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1561-4042&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1561-4042&client=summon