Subgraph isomorphism, matching relational structures and maximal cliques (Q1245239): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q30053698, #quickstatements; #temporary_batch_1710346988437 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 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
1976
0 references
