Pages that link to "Item:Q714793"
From MaRDI portal
The following pages link to An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793):
Displaying 7 items.
- A new characterization of HH-free graphs (Q942119) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs (Q3612594) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710826) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- Certifying induced subgraphs in large graphs (Q6636998) (← links)