A direct method for calculating cell cycles of a block map of a simple planar graph (Q5871440): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cycle Generation Algorithm for Finite Undirected Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Algorithms for Enumerating All Circuits of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for minimum cycle bases of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a fundamental set of cycles of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank

Latest revision as of 08:02, 31 July 2024

scientific article; zbMATH DE number 7643918
Language Label Description Also known as
English
A direct method for calculating cell cycles of a block map of a simple planar graph
scientific article; zbMATH DE number 7643918

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references