A linear algorithm for restructuring a graph

DOI10.1134/S0005117918120093MaRDI QIDQ1735229zbMATH OpenOpenAlexFDO

Authors Konstantin Yu. Gorbunov, Vassily Lyubetsky

Publication date 28 March 2019

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117918120093

zbMATH Keywords

cyclechaingraph transformationcombinatorial problemlinear algorithmoperation costoptimization on graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 3974289
• scientific article; zbMATH DE number 2032341
• A basic algorithm for graph reconstruction
• scientific article; zbMATH DE number 6102919
• On the structure of linear graphs
• On the structure of linear graphs
• scientific article; zbMATH DE number 5937963
• scientific article; zbMATH DE number 4062622

Cites work

• Exemplar or matching: modeling DCJ problems with unequal content genome data
• Linear algorithm for minimal rearrangement of structures

Cited in

(6)

• Linear algorithm for minimal rearrangement of structures
• Approximating shortest connected graph transformation for trees
• Efficient reassembling of graphs. I: The linear case
• Algebraic operations on graphs preserving the degree sequence
• Linear algorithm for a cyclic graph transformation
• The minimum-cost transformation of graphs

Describes a project that uses

Uses Software

• ChromoGGL

This page was built for publication: A linear algorithm for restructuring a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735229)