A linear algorithm for perfect matching in hexagonal systems (Q1313858): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Mao Lin Zheng / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: László A. Székely / rank
Normal rank
 
Property / author
 
Property / author: Mao Lin Zheng / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: László A. Székely / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in hexagonal systems / rank
 
Normal rank

Latest revision as of 11:58, 22 May 2024

scientific article
Language Label Description Also known as
English
A linear algorithm for perfect matching in hexagonal systems
scientific article

    Statements

    A linear algorithm for perfect matching in hexagonal systems (English)
    0 references
    0 references
    0 references
    1 March 1994
    0 references
    A hexagonal system is a two-connected plane graph in which each interior face is a regular hexagon. Empirical evidence shows that a benzenoid molecule corresponding to the hexagonal system exists if and only if the hexagonal system has a perfect matching (Kekulé system). The paper proposes a linear-time algorithm to find a perfect matching or to show that there is none.
    0 references
    Kekulé system
    0 references
    hexagonal system
    0 references
    perfect matching
    0 references
    linear-time algorithm
    0 references

    Identifiers