Subgraph isomorphism, matching relational structures and maximal cliques (Q1245239): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Rod M. Burstall / rank
Normal rank
 
Property / author
 
Property / author: Rod M. Burstall / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q30053698 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(76)90049-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068379792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A versatile system for computer-controlled assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:03, 12 June 2024

scientific article
Language Label Description Also known as
English
Subgraph isomorphism, matching relational structures and maximal cliques
scientific article

    Statements

    Subgraph isomorphism, matching relational structures and maximal cliques (English)
    0 references
    0 references
    0 references
    1976
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references