Parameterized algorithms for min–max 2-cluster editing

For a given graph and an integer t , the Min – Max 2-Clustering problem asks if there exists a modification of a given graph into two maximal disjoint cliques by inserting or deleting edges such that the number of the editing edges incident to each vertex is at most t . It has been shown that the pr...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 34; číslo 1; s. 47 - 63
Hlavní autori:	Chen, Li-Hsuan, Wu, Bang Ye
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2017 Springer Nature B.V
Predmet:	Algorithms Clustering Clusters Combinatorics Complexity Convex and Discrete Geometry Design parameters Editing Graph theory Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Parameterization Satellites Theory of Computation Subexponential algorithm Parameterized algorithm Graph modification Clustering Randomized algorithm Parameterized complexity
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!