Finding and counting small induced subgraphs efficiently (Q294749): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 5 users not shown) | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56210426 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding and counting given length cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear Recognition Algorithm for Cographs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Claw-free graphs---a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Minimum Circuit in a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3688439 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paw-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2150875823 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:32, 30 July 2024
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