Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (Q2922637): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56976982, #quickstatements; #temporary_batch_1711574657256 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_43 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W21966713 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56976982 / rank | |||
Normal rank | |||
Latest revision as of 00:21, 28 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs |
scientific article |
Statements
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (English)
0 references
14 October 2014
0 references
tree decomposition
0 references
maximum common subgraph
0 references
series-parallel graph
0 references
