Login / Signup
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs.
Nils M. Kriege
Petra Mutzel
Published in:
MFCS (2) (2014)
Keyphrases
</>
series parallel
temporal reasoning
tree decomposition
constraint networks
precedence constraints
maximum clique
graph mining
network design
redundancy allocation