Three Partition Refinement Algorithms

Recommendations

Partition refinement techniques: an interesting algorithmic tool kit
A tight bound for 3-partitioning
Reduction of the three-partition problem
Three-partitioning containing kernels: Complexity and heuristic
Three aspects of partitions
A 3/2-approximation algorithm for k_i-partitioning
Optimal partitions for triples
A greedy heuristic for 3-partitioning with similar elements
Partitioning 3-uniform hypergraphs
Publication:4953911

Cited in

(only showing first 100 items - show all)

From a simple elimination ordering to a strong elimination ordering in linear time
(Bi)simulations up-to characterise process semantics
\(k\)-tuple domination in graphs
Optimal state-space lumping in Markov chains
Hardness of equivalence checking for composed finite-state systems
Fast equation automaton computation
Improved algorithms for the multicut and multiflow problems in rooted trees
Algorithmic aspects of a general modular decomposition theory
Phylogenetic graph models beyond trees
Probabilistic weak simulation is decidable in polynomial time
An efficient simulation algorithm based on abstract interpretation
A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
Minimizing the number of transitions with respect to observation equivalence
Minimisation of acyclic deterministic automata in linear time
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
The parallel complexity of coarsest set partition problems
Strong elimination ordering of the total graph of a tree
Deciding bisimilarity is P-complete
Set constraints and logic programming
Sorting in linear time?
On performance congruences for process algebras
A process algebra with distributed priorities
The domatic number problem on some perfect graph families
A general approach to avoiding two by two submatrices
Characterizations of two classes of digraphs
Complexity of equivalence problems for concurrent systems of finite agents
The algorithmic use of hypertree structure and maximum neighbourhood orderings
On the decidability of process equivalences for the \(\pi\)-calculus
Maximum vertex-weighted matching in strongly chordal graphs
Generalizations of suffix arrays to multi-dimensional matrices.
Undecidability of domino games and hhp-bisimilarity.
A complexity analysis of bisimilarity for value-passing processes
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
Re-describing an algorithm by Hopcroft
Operational and abstract semantics of the query language G-Log
Design of decentralized critical observers for networks of finite state machines: a formal method approach
Counting minimal transversals of -acyclic hypergraphs
Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
Applying model-checking to solve queries on semistructured data
Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
Complexity of distance paired-domination problem in graphs
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
A simple linear time algorithm for cograph recognition
Linear-time modular decomposition of directed graphs
Coalgebraic minimization of HD-automata for the -calculus using polymorphic types
The quest for minimal quotients for probabilistic and Markov automata
An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
A reduction technique for weighted grouping problems
Canonical derivatives, partial derivatives and finite automaton constructions.
A partition refinement algorithm for the -calculus
Iterating transducers
An efficient algorithm for computing bisimulation equivalence
Verifying persistent security properties
Permuting matrices to avoid forbidden submatrices
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
All-pairs-shortest-length on strongly chordal graphs
Finding a sun in building-free graphs
A good characterization of squares of strongly chordal split graphs
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
Partition refinement of component interaction automata
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
Deciding bisimilarity and similarity for probabilistic processes.
From generic partition refinement to weighted tree automata minimization
The complexity of identifying characteristic formulae
Aggregation-based minimization of finite state automata
A study on team bisimulation and H-team bisimulation for BPP nets
On list \(k\)-coloring convex bipartite graphs
Verification and strategy synthesis for coalition announcement logic
Bisimilarity on basic parallel processes
Reduced-order observer design for fault diagnosis of Boolean control networks
An extension of ERODE to reduce Boolean networks by backward Boolean equivalence
Reducing Boolean networks with backward Boolean equivalence
Injective hulls of various graph classes
Manipulation of regular expressions using derivatives: an overview
On the axiomatisability of priority. III: Priority strikes again
Team equivalences for finite-state machines with silent moves
Team bisimilarity, and its associated modal logic, for BPP nets
A large-scale assessment of exact lumping of quantitative models in the biomodels repository
Set graphs. II. Complexity of set graph recognition and similar problems
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Unwinding biological systems
Employing behavioral preorders to define controllability for nondeterministic discrete-event systems
Compositional verification of asynchronous concurrent systems using CADP
Doubly lexical ordering of dense 0--1 matrices
Testing equivalence as a bisimulation equivalence
Priority and abstraction in process algebra
Tight lower and upper bounds for the complexity of canonical colour refinement
Applying clique-decomposition for computing Gromov hyperbolicity
On the relations between Markov chain lumpability and reversibility
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
Verification of finite-state machines: a distributed approach
Variations of maximum-clique transversal sets on graphs
Deadlock-freedom in component systems with architectural constraints
Rainbow domination and related problems on strongly chordal graphs
A logical framework for privacy-preserving social network publication
Deciding orthogonal bisimulation
Bisimulation relations for weighted automata

This page was built for publication: Three Partition Refinement Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801084)