Counting Euler Tours in Undirected Bounded Treewidth Graphs (Q5275372): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Counting Euler Tours in Undirected Bounded Treewidth Graphs | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1510.04035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963761951 / rank | |||
Normal rank | |||
| Property / title | |||
Counting Euler Tours in Undirected Bounded Treewidth Graphs (English) | |||
| Property / title: Counting Euler Tours in Undirected Bounded Treewidth Graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 09:59, 30 July 2024
scientific article; zbMATH DE number 6744922
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Euler Tours in Undirected Bounded Treewidth Graphs |
scientific article; zbMATH DE number 6744922 |
Statements
13 July 2017
0 references
Euler tours
0 references
bounded treewidth
0 references
bounded clique-width
0 references
Hamiltonian cycles
0 references
parallel algorithms
0 references
Counting Euler Tours in Undirected Bounded Treewidth Graphs (English)
0 references
