Recent Submissions

  • Bounded queries to arbitrary sets 

    Lozano Bojados, Antoni (1991-09)
    External research report
    Open Access
    We 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] 

    Lozano Bojados, Antoni; Torán Romero, Jacobo (1989)
    External research report
    Open Access
  • Self-reducible sets of small density 

    Lozano Bojados, Antoni; Torán Romero, Jacobo (1989-11)
    External research report
    Open Access
    We 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 

    Lozano Bojados, Antoni (1988-05)
    External research report
    Open Access
  • Locating domination in bipartite graphs and their complements 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
    External research report
    Open Access
    A 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 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
    External research report
    Open Access
    A 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 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-10-16)
    External research report
    Open Access
    Limited 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 ...
  • From subKautz digraphs to cyclic Kautz digraphs 

    Dalfó Simó, Cristina (2017)
    External research report
    Open Access
    Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, ...
  • On quotient digraphs and voltage digraphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe (2016)
    External research report
    Open Access
    In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line ...
  • Connected and internal graph searching 

    Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
    External research report
    Open Access
    This paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ...
  • General bounds on limited broadcast domination 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
    External research report
    Open Access
    Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...
  • Symmetry breaking in tournaments 

    Lozano Bojados, Antoni (2010)
    External research report
    Open Access
    We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, ...

View more