Correlation Clustering admits polynomial kernels parameterized by k plus degeneracy or closure of the fuzzy edge graph.
V erification o f Timed-Arc Petri Nets
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.
citing papers explorer
-
Clustering with Locally Bounded Ignorance
Correlation Clustering admits polynomial kernels parameterized by k plus degeneracy or closure of the fuzzy edge graph.
-
Waiting Nets: State Classes and Taxonomy
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.