Navegação Relatórios Técnicos e de Pesquisa por Assunto "Gramatica : Grafos"
Resultados 1-1 de 1
-
Maximum matching with ordering constraints is NP-complete
(2009) [Relatório Técnico e de Pesquisa]A maximum weighted matching in a graph can be computed in polynomial time. In this paper we show that a variant, where the matching lias to respect additional ordering constraints between the vertices makes the problem ...