Pages that link to "Item:Q4595494"
From MaRDI portal
The following pages link to Parallel algorithms for series parallel graphs (Q4595494):
Displaying 15 items.
- Efficient parallel graph algorithms based on open ear decomposition (Q688195) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- Parallel recognition and decomposition of two terminal series parallel graphs (Q1098313) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method (Q2106620) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- (Q3800085) (← links)
- Maximum independent number for series-parallel networks (Q3977271) (← links)
- Deterministic Dcomposition of Recursive Graph Classes (Q3985535) (← links)
- (Q4730797) (← links)
- Series-Parallel Operations with Alpha-Graphs (Q5205653) (← links)
- Space efficient algorithms for directed series–parallel graphs (Q5491454) (← links)
- Parallel algorithms for series parallel graphs and graphs with treewidth two (Q5943662) (← links)