scientific article; zbMATH DE number 108280
zbMATH Open0778.06002MaRDI QIDQ4023737FDOQ4023737
Authors: Jens Gustedt 
Publication date: 23 January 1993
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (18)
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
- 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
- Title not available (Why is that?)
- On well quasiordering of finite languages
- The order of Appel's algorithm
- Title not available (Why is that?)
- Combinatorics and algorithms for quasi-chain graphs
- Chain minors are FPT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chain minors are FPT
- Order-Sorted Parameterization and Induction
- Order-\(N\) methodologies and their applications
- The ideal approach to computing closed subsets in well-quasi-orderings
- A Framework for Order-Sorted Algebra
- Minimal antichains in well-founded quasi-orders with an application to tournaments
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)
