Pages that link to "Item:Q3801084"
From MaRDI portal
The following pages link to Three Partition Refinement Algorithms (Q3801084):
Displaying 50 items.
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Structural similarity: spectral methods for relaxed blockmodeling (Q286617) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Lumping evolutionary game dynamics on networks (Q309237) (← links)
- Arbitrary arrow update logic (Q343913) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Action emulation (Q375313) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Simulation relations for pattern matching in directed graphs (Q388784) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Fast brief practical DFA minimization (Q437674) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- On bisimulations for description logics (Q527171) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
- Weighted o-minimal hybrid systems (Q636266) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- A simple sub-quadratic algorithm for computing the subset partial order (Q672836) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Is hyper-extensionality preservable under deletions of graph elements? (Q737091) (← links)
- Priorities in process algebras (Q802881) (← links)
