EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH

DOI10.17223/20710410/29/6OpenAlexW4235225260MaRDI QIDQ5150702

S. I. Polyuga, I. V. Kozin, S. V. Kurapov

Publication date: 15 February 2021

Published in: PRIKLADNAYa DISKRETNAYa MATEMATIKA (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm513

zbMATH Keywords

graphisometric cyclesevolutionarily-fragmented algorithmfragmented structuremaximally flat part of graph

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items

Construction of a topological drawing of the most planar subgraph of the non-planar graph

Cites Work

• The topological drawing of a graph: construction methods
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item