Pages that link to "Item:Q3801084"
From MaRDI portal
The following pages link to Three Partition Refinement Algorithms (Q3801084):
Displaying 50 items.
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- Checking timed Büchi automata emptiness efficiently (Q816203) (← links)
- Reasoning about proportional lumpability (Q832089) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- Symbolic models for control systems (Q868433) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- Tempus fugit: How to plug it (Q997994) (← links)
- From a simple elimination ordering to a strong elimination ordering in linear time (Q1007631) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Optimal state-space lumping in Markov chains (Q1014448) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Fast equation automaton computation (Q1018095) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Phylogenetic graph models beyond trees (Q1026198) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- Minimisation of acyclic deterministic automata in linear time (Q1190464) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- Strong elimination ordering of the total graph of a tree (Q1201815) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- Set constraints and logic programming (Q1271565) (← links)
- Sorting in linear time? (Q1273863) (← links)
- On performance congruences for process algebras (Q1275822) (← links)
- A process algebra with distributed priorities (Q1276244) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Characterizations of two classes of digraphs (Q1336693) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
