Buscar
Mostrando ítems 1-10 de 893
Complexity of the cluster deletion problem on subclasses of chordal graphs
(Elsevier Science, 2015-10)
We consider the following vertex-partition problem on graphs, known as the CLUSTER DELETION (CD) problem: given a graph with real nonnegative edge weights, partition the vertices into clusters (in this case, cliques) to ...
Split Clique Graph complexity
(Elsevier Science, 2013-09)
A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by C(G) the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph ...
Np-completeness results for edge modification problems
(NORTH HOLLAND, 2006)
NP-completeness results for edge modification problems
(ELSEVIER, 2006-08-15)
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs have a lot of applications in different ...
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
(Elsevier Science, 2013-02)
We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the ...
Injective Colorings with Arithmetic Constraints
(Springer, 2015)
An injective coloring of a graph is a vertex labeling such that two vertices sharing a common neighbor get different labels. In this work we introduce and study what we call additive colorings. An injective coloring of a ...