Pages that link to "Item:Q3801084"

The following pages link to Three Partition Refinement Algorithms (Q3801084):

Displaying 50 items.

• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
• Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
• Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
• Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
• A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
• Re-describing an algorithm by Hopcroft (Q1589443) (← links)
• Operational and abstract semantics of the query language G-Log (Q1607222) (← links)
• Design of decentralized critical observers for networks of finite state machines: a formal method approach (Q1678627) (← links)
• Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
• Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses (Q1753998) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• A simple linear time algorithm for cograph recognition (Q1764804) (← links)
• Linear-time modular decomposition of directed graphs (Q1764805) (← links)
• Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
• The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
• An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
• Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences (Q1794961) (← links)
• A reduction technique for weighted grouping problems (Q1848576) (← links)
• Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
• A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
• Iterating transducers (Q1858440) (← links)
• An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
• Verifying persistent security properties (Q1886452) (← links)
• Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
• All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
• Finding a sun in building-free graphs (Q1926049) (← links)
• A good characterization of squares of strongly chordal split graphs (Q1944051) (← links)
• A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
• Partition refinement of component interaction automata (Q1951613) (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
• Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
• From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
• The complexity of identifying characteristic formulae (Q1987735) (← links)
• Aggregation-based minimization of finite state automata (Q2035006) (← links)
• A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Verification and strategy synthesis for coalition announcement logic (Q2071573) (← links)
• Bisimilarity on basic parallel processes (Q2072066) (← links)
• Reduced-order observer design for fault diagnosis of Boolean control networks (Q2097771) (← links)
• An extension of ERODE to reduce Boolean networks by backward Boolean equivalence (Q2112170) (← links)
• Reducing Boolean networks with backward Boolean equivalence (Q2142096) (← links)
• Injective hulls of various graph classes (Q2155861) (← links)
• Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
• On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)