scientific article; zbMATH DE number 108280
finite graphsparallelizationcographsparallel machineaverage-case complexityworst-case complexityquasi-orderswell-quasi-orderingsinduced subgraph relation0-1-law for hereditary propertiesbounded decomposition diameterchain minor relationfinite formal languagesinduced suborder
Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
- Order-Sorted Parameterization and Induction
- The ideal approach to computing closed subsets in well-quasi-orderings
- Chain minors are FPT
- Data structures for order-sensitive predicates in parallel nondeterministic systems
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
- On well quasiordering of finite languages
- scientific article; zbMATH DE number 475611 (Why is no real title available?)
- Chain minors are FPT
- scientific article; zbMATH DE number 1885201 (Why is no real title available?)
- A Framework for Order-Sorted Algebra
- scientific article; zbMATH DE number 6536488 (Why is no real title available?)
- scientific article; zbMATH DE number 1554934 (Why is no real title available?)
- Order-\(N\) methodologies and their applications
- The order of Appel's algorithm
- Minimal antichains in well-founded quasi-orders with an application to tournaments
- scientific article; zbMATH DE number 2242592 (Why is no real title available?)
- Combinatorics and algorithms for quasi-chain graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023737)