Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms |
scientific article |
Statements
Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (English)
0 references
13 May 2009
0 references
maximum common subgraph
0 references
linegraph
0 references
subdivision graph
0 references
compatibility graph
0 references
constraints satisfaction algorithm
0 references
clique detection
0 references
