Finding and counting small induced subgraphs efficiently (Q294749): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6594085 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph algorithms | |||
| Property / zbMATH Keywords: graph algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
simplicial vertex | |||
| Property / zbMATH Keywords: simplicial vertex / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
claw-free graph | |||
| Property / zbMATH Keywords: claw-free graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
diamond-free graph | |||
| Property / zbMATH Keywords: diamond-free graph / rank | |||
Normal rank | |||
Revision as of 20:35, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding and counting small induced subgraphs efficiently |
scientific article |
Statements
Finding and counting small induced subgraphs efficiently (English)
0 references
16 June 2016
0 references
graph algorithms
0 references
simplicial vertex
0 references
claw-free graph
0 references
diamond-free graph
0 references
