Faster algorithms for finding and counting subgraphs (Q439930): 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 / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C60 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6067699 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parameterized complexity | |||
Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subgraph isomorphism | |||
Property / zbMATH Keywords: subgraph isomorphism / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
homomorphism | |||
Property / zbMATH Keywords: homomorphism / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
counting | |||
Property / zbMATH Keywords: counting / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
treewidth | |||
Property / zbMATH Keywords: treewidth / rank | |||
Normal rank |
Revision as of 00:50, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Faster algorithms for finding and counting subgraphs |
scientific article |
Statements
Faster algorithms for finding and counting subgraphs (English)
0 references
17 August 2012
0 references
parameterized complexity
0 references
subgraph isomorphism
0 references
homomorphism
0 references
counting
0 references
treewidth
0 references