Pruning the search tree in the constructive enumeration of molecular graphs (Q1917340): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jiři Pospíchal / rank
Normal rank
 
Property / author
 
Property / author: Vladimir Kvasnička / rank
Normal rank
 
Property / author
 
Property / author: Jiři Pospíchal / rank
 
Normal rank
Property / author
 
Property / author: Vladimir Kvasnička / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3764177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive graph labeling using double cosets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for sequences to be r-graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderly algorithms for generating restricted classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3143073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 24 May 2024

scientific article
Language Label Description Also known as
English
Pruning the search tree in the constructive enumeration of molecular graphs
scientific article

    Statements

    Pruning the search tree in the constructive enumeration of molecular graphs (English)
    0 references
    19 November 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    enumeration of molecular graphs
    0 references
    labeling
    0 references
    adjacency matrix
    0 references
    search tree
    0 references
    automorphism group
    0 references
    0 references
    0 references