1 exercise

Search tips: start over - to expand, or dig in by adding more tags and revising the query.

29

views

no

votes

Recognizing series-parallel graphs in linear time

Let $G(V,E)$ be a simple undirected graph with $|V| = n$ and $|E| = m$. Let the treewidth of $G$ be at most $k$. Deriv…

• ALGORITHMS
• GRAPH THEORY

 

• treewidth
• chordal-graph
• series-parallel
• linear-time-algorith...