Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (Q5428821): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_31 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1565474750 / rank | |||
Normal rank |
Latest revision as of 03:46, 20 March 2024
scientific article; zbMATH DE number 5215579
Language | Label | Description | Also known as |
---|---|---|---|
English | Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs |
scientific article; zbMATH DE number 5215579 |
Statements
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (English)
0 references
28 November 2007
0 references