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)

Bisimilarity Minimization in O(m logn) Time
Computing Simulations over Tree Automata
An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
On the complexity of variations of mixed domination on graphs
An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
The complexity of identifying characteristic formulae
A partition refinement algorithm for the -calculus
Efficient and modular coalgebraic partition refinement
An Incremental Bisimulation Algorithm
On performance congruences for process algebras
Reduced-order observer design for fault diagnosis of Boolean control networks
Canonical derivatives, partial derivatives and finite automaton constructions.
Incremental NFA minimization
Prefix sorting DFAs: a recursive algorithm
Process algebra and model checking
Monge and feasibility sequences in general flow problems
EXPTIME-completeness of thorough refinement on modal transition systems
Modal transition systems with weight intervals
An optimal algorithm to recognize Robinsonian dissimilarities
Iterating transducers
Automatic verification of distributed systems: the process algebra approach.
An efficient fully symbolic bisimulation algorithm for non-deterministic systems
Connection between logical and algebraic approaches to concurrent systems
Reasoning about proportional lumpability
Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
I/O-efficient algorithms for graphs of bounded treewidth
scientific article; zbMATH DE number 6970796 (Why is no real title available?)
A tableau construction for finite linear-time temporal logic
Operational and abstract semantics of the query language G-Log
A linear-time algorithm for paired-domination problem in strongly chordal graphs
A Space-Efficient Probabilistic Simulation Algorithm
scientific article; zbMATH DE number 7327941 (Why is no real title available?)
Decidability results in automata and process theory
Organizing the atoms of the clique separator decomposition into an atom tree
Weighted maximum-clique transversal sets of graphs
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
Obstructions to faster diameter computation: asteroidal sets
A Study on Team Bisimulations for BPP Nets
Soundness of reset workflow nets
An extension of ERODE to reduce Boolean networks by backward Boolean equivalence
Injective hulls of various graph classes
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Reducing Boolean networks with backward Boolean equivalence
The secret life of keys: on the calculation of mechanical lock systems
Tight lower and upper bounds for the complexity of canonical colour refinement
Generalizations of suffix arrays to multi-dimensional matrices.
The parallel complexity of elimination ordering procedures
Deriving Bisimulations by Simplifying Partitions
A normal form for stateful connectors
Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
Experiments with deterministic -automata for formulas of linear temporal logic
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
A large-scale assessment of exact lumping of quantitative models in the biomodels repository
The domatic number problem on some perfect graph families
Using multiset discrimination to solve language processing problems without hashing
Bisimulations for fuzzy automata
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Modules and PQ-trees in Robinson spaces
Signed and minus clique-transversal functions on graphs
(Bi)simulations up-to characterise process semantics
On the computational complexity of bisimulation, redux
An efficient algorithm to determine probabilistic bisimulation
Quantitative abstractions for collective adaptive systems
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
Robust stutter bisimulation for abstraction and controller synthesis with disturbance
Deciding probabilistic automata weak bisimulation: theory and practice
SOS formats and meta-theory: 20 years after
Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Interleaving vs True Concurrency: Some Instructive Security Examples
The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
Forward bisimulations for nondeterministic symbolic finite automata
Unwinding biological systems
Applying model-checking to solve queries on semistructured data
Polynomial time decision algorithms for probabilistic automata
Priorities in process algebras
A process algebra with distributed priorities
Rank-based symbolic bisimulation: (and model checking)
Structural similarity: spectral methods for relaxed blockmodeling
Lowerbounds for Bisimulation by Partition Refinement
Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
Deciding bisimilarity is P-complete
Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
Construction of Aho Corasick automaton in linear time for integer alphabets
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
An approximation algorithm for clustering graphs with dominating diametral path
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
Pushdown automata, multiset automata, and Petri nets
On the complexity of signed and minus total domination in graphs
Performance preserving equivalence for stochastic process algebra dtsdPBC
Relation coarsest partition method to observability of probabilistic Boolean networks
Construction of tree automata from regular expressions
Fast brief practical DFA minimization
On divergence-sensitive weak probabilistic bisimilarity
Strong elimination ordering of the total graph of a tree
Verification of finite-state machines: a distributed approach

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)