Linear-time Algorithm for Partial Representation Extension of Interval Graphs.
Pavel KlavíkJan KratochvílYota OtachiToshiki SaitohTomás VyskocilPublished in: CoRR (2013)
Keyphrases
- detection algorithm
- learning algorithm
- times faster
- cost function
- significant improvement
- preprocessing
- dynamic programming
- objective function
- high accuracy
- k means
- experimental evaluation
- worst case
- simulated annealing
- similarity measure
- undirected graph
- recognition algorithm
- probabilistic model
- clustering method
- expectation maximization
- particle swarm optimization
- computational cost
- search space
- np hard
- graph theory
- graph model
- association rules
- graph clustering