Pages that link to "Item:Q3806839"
From MaRDI portal
The following pages link to NC algorithms for recognizing chordal graphs and k trees (Q3806839):
Displayed 7 items.
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- An nc algorithm to recognize hhd-free graphs (Q4009712) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)