Reports de recerca
Recent Submissions
-
Contiguous and internal graph searching
(2002)
Research report
Open AccessIn the graph searching problem, we are given a graph whose edges are all "contaminated", and, via a sequence of "steps" using "searchers", we want to obtain a state of the graph in which all edges are simultaneously "clear". ... -
On the non-uniform complexity of the Graph Isomorphism problem
(1992-02-19)
Research report
Open AccessWe study the non-uniform complexity of the Graph Isomorphism (GI) and Graph Automorphism (GA) problems considering the implications of different types of polynomial time reducibilitites from these problems to sparse sets. ... -
Bounded queries to arbitrary sets
(1991-09)
Research report
Open AccessWe prove that if P superA[k] = P superA[k+1] for some k and an arbitrary set A, then A is reducible to its complement under a relativized nondeterministic conjunctive reduction. This result shows the first known property ... -
Relativized and positive separations of [delta sub 2 super p] and [fi sub 2 super p]
(1989)
Research report
Open Access -
Self-reducible sets of small density
(1989-11)
Research report
Open AccessWe study the complexity of sets that are at the same time self-reducible and sparse or m-reducible to sparse sets. We show that sets of this kind are low for the complexity clases [delta sub 2 super p], [fi sub 2 super p], ... -
Complejidad de problemas sobre representaciones sucintas de grafos
(1988-05)
Research report
Open Access -
Trees whose even-degree vertices induce a path are antimagic
(2019-05-16)
Research report
Open AccessAn antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels ... -
The neighbor-locating-chromatic number of pseudotrees
(2019-03-28)
Research report
Open AccessAk-coloringof a graphGis a partition of the vertices ofGintokindependent sets,which are calledcolors. Ak-coloring isneighbor-locatingif any two vertices belongingto the same color can be distinguished from each other by ... -
Neighbor-locating colorings in graphs
(2018-06-29)
Research report
Open AccessA k -coloring of a graph G is a k -partition ¿ = { S 1 ,...,S k } of V ( G ) into independent sets, called colors . A k -coloring is called neighbor-locating if for every pair of vertices u,v belonging to the same color S ... -
Locating domination in bipartite graphs and their complements
(2017-11-03)
Research report
Open AccessA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Metric-locating-dominating partitions in graphs
(2017-11-03)
Research report
Open AccessA partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metric-locating partition of G if for every pair of vertices u,v belonging to the same part S i , d ( u,S j ) 6 = d ( v,S j ), for some other ... -
Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs
(2017-10-16)
Research report
Open AccessLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
RSS 1.0