Three Partition Refinement Algorithms
From MaRDI portal
Publication:3801084
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)- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- An Implementation of Deterministic Tree Automata Minimization
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs
- Set constraints and logic programming
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
- Generic top-down discrimination for sorting and partitioning in linear time
- Using multiset discrimination to solve language processing problems without hashing
- Fast brief practical DFA minimization
- Generalizations of suffix arrays to multi-dimensional matrices.
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Phylogenetic graph models beyond trees
- Hardness of equivalence checking for composed finite-state systems
- Bisimilarity Minimization in O(m logn) Time
- A Space-Efficient Probabilistic Simulation Algorithm
- On deciding some equivalences for concurrent processes
- Translating FSP into LOTOS and networks of automata
- Sorting in linear time?
- Is hyper-extensionality preservable under deletions of graph elements?
- Generalizations of suffix arrays to multi-dimensional matrices.
- Distributed Markovian bisimulation reduction aimed at CSL model checking
- Stepwise development of process-algebraic specifications in decorated trace semantics
- COMPOSED BISIMULATION FOR TREE AUTOMATA
- An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Monge and feasibility sequences in general flow problems
- EXPTIME-completeness of thorough refinement on modal transition systems
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Weak bisimulation for probabilistic timed automata
- Partially ordered knapsack and applications to scheduling
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Minimisation of acyclic deterministic automata in linear time
- Thread algebra for noninterference
- Fast equation automaton computation
- From tree automata to string automata minimization
- Iterating transducers
- Applying model-checking to solve queries on semistructured data
- An aperiodic set of 11 Wang tiles
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- On the computational complexity of bisimulation, redux
- Time abstracted bisimulation: Implicit specifications and decidability
- The Dilworth number of auto-chordal bipartite graphs
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Partition refinement techniques: an interesting algorithmic tool kit
- Algorithmic aspects of a general modular decomposition theory
- On bisimulations for description logics
- Computing \(H\)-joins with application to 2-modular decomposition
- Simulation relations and applications in formal methods
- An algebraic theory of multiple clocks
- Symbolic models for control systems
- Computing maximal weak and other bisimulations
- An efficient algorithm for computing bisimulation equivalence
- An efficient simulation algorithm based on abstract interpretation
- Weighted o-minimal hybrid systems
- An algorithmic view of gene teams
- Towards the hierarchical verification of reactive systems
- Pushdown automata, multiset automata, and Petri nets
- A succinct canonical register automaton model
- An Incremental Bisimulation Algorithm
- On performance congruences for process algebras
- Complexity of distance paired-domination problem in graphs
- Canonical derivatives, partial derivatives and finite automaton constructions.
- A good characterization of squares of strongly chordal split graphs
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Checking timed Büchi automata emptiness efficiently
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Minimizing the number of transitions with respect to observation equivalence
- Optimal state-space lumping in Markov chains
- Arbitrary arrow update logic
- On recognition of threshold tolerance graphs and their complements
- Minimal transition systems for history-preserving bisimulation
- Computing Simulations over Tree Automata
- Symbolic computation of differential equivalences
- A uniform (bi-)simulation-based framework for reducing tree automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Structural similarity: spectral methods for relaxed blockmodeling
- Deciding probabilistic automata weak bisimulation: theory and practice
- A simple linear time algorithm for cograph recognition
- Backward and forward bisimulation minimization of tree automata
- Bisimulations for fuzzy automata
- Linear-time modular decomposition of directed graphs
- Deciding bisimilarity is P-complete
- Organizing the atoms of the clique separator decomposition into an atom tree
- Fuzzy relation equations and reduction of fuzzy automata
- SOS formats and meta-theory: 20 years after
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Weighted maximum-clique transversal sets of graphs
- Action emulation
- Permuting matrices to avoid forbidden submatrices
- Probabilistic weak simulation is decidable in polynomial time
- Arboricity, \(h\)-index, and dynamic algorithms
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Undecidability of domino games and hhp-bisimilarity.
- Minimization of finite state automata through partition aggregation
- Interval-like graphs and digraphs
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)
