The ( k , - ) partitioned probe problem: NP-complete versus polynomial dichotomy

Título:

The ( k , - ) partitioned probe problem: NP-complete versus polynomial dichotomy

Autor:

Simone Dantas de Souza

Ano:

2017

DOI:

10.1016/j.dam.2017.02.006

Revista:

DISCRETE APPLIED MATHEMATICS

ISSN:

0166218X

Tags:

graph sandwich problem

Home:

[doi:10.1016/j.dam.2017.02.006]

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem

Passeando em grafos: uma abordagem de teoria de grafos no ensino médio

Gene clusters as intersection of powes of paths

On the maximum number of minimum dominating sets in forests

2K2-partition of some classes of graphs

On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers

On the contour of graphs

Averaging 2-rainbow domination and Roman domination

2K2 vertex-set partition into nonemptyparts

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum