Pages that link to "Item:Q1336630"
From MaRDI portal
The following pages link to Regularity and locality in \(k\)-terminal graphs (Q1336630):
Displaying 8 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- Maintaining regular properties dynamically in \(k\)-terminal graphs (Q1273938) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Definability equals recognizability of partial 3-trees (Q6550548) (← links)