Clustering with Local Restrictions (Q3012850)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Clustering with Local Restrictions	scientific article

Statements

scholarly article

0 references

Clustering with Local Restrictions (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-22006-7_66

0 references

Daniel Lokshtanov

0 references

0 references

Automata, Languages and Programming

0 references

publication date

6 July 2011

0 references

full work available at URL

https://arxiv.org/abs/1711.03885

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Aggregating inconsistent information

0 references

0 references

Correlation clustering

0 references

Dynamic Programming Treatment of the Travelling Salesman Problem

0 references

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

0 references

A fixed-parameter algorithm for the directed feedback vertex set problem

0 references

0 references

Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs

0 references

On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory

0 references

Clustering with local restrictions

0 references

Parameterized graph separation problems

0 references

Fixed-parameter tractability of multicut parameterized by the size of the cutset

0 references

0 references

0 references

0 references

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3012850

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3012850&oldid=35236379"