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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1183596
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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

Latest revision as of 22:03, 12 June 2024

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

    Statements

    Identifiers

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