Enviaments recents

  • Connected and internal graph searching 

    Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
    Report de recerca
    Accés obert
    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 ...
  • Unranking of combinatorial structures 

    Molinero Albareda, Xavier (1997-07)
    Report de recerca
    Accés obert
    The present work is a study of the deterministic generation of combinatorial structures. We generate classes of combinatorial structures formally specifiable by grammars involving unlabelled sequence, unlabelled set, ...
  • The Plogi and ACi-1 operators on the polynomial time hierarchy 

    Castro Rabal, Jorge; Seara Ojea, Carlos (1993-11)
    Report de recerca
    Accés obert
    In a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ...
  • Generic algorithms for the generation of combinatorial objects 

    Molinero Albareda, Xavier; Martínez Parra, Conrado (2003-06)
    Report de recerca
    Accés obert
    This report briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes. Our algorithms receive a size n and a finite description of a combinatorial class A using ...
  • An Efficient generic algorithm for the generation of unlabelled cycles 

    Martínez Parra, Conrado; Molinero Albareda, Xavier (2003-06-06)
    Report de recerca
    Accés obert
    In this report we combine two recent generation algorithms to obtain a new algorithm for the generation of unlabelled cycles. Sawada's algorithm lists all k-ary unlabelled cycles with fixed content, that is, the number ...
  • 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)
    Report de recerca
    Accés obert
    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 ...
  • New results on metric-locating-dominating sets of graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; González, Antonio (2016-04-13)
    Report de recerca
    Accés obert
    A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the ...
  • Non-commutative integrable systems on b-symplectic manifolds 

    Miranda Galcerán, Eva; Kiesenhofer, Anna (2016)
    Report de recerca
    Accés obert
    In this paper we study non-commutative integrable systems on b-Poisson manifolds. One important source of examples (and motiva- tion) of such systems comes from considering non-commutative systems on manifolds with ...
  • The HOM problem is decidable 

    Godoy, Guillem; Giménez, Omer; Ramos Garrido, Lander; Álvarez Faura, M. del Carme (2009-06)
    Report de recerca
    Accés obert
    We close affirmatively a question which has been open for 35 years: decidability of the HOM problem. The HOM problem consists in deciding, given a tree homomorphism $H$ and a regular tree languagle $L$ represented by a ...
  • Some advances in the theory of voting systems based on experimental algorithms 

    Freixas Bosch, Josep; Molinero Albareda, Xavier (2006-01)
    Report de recerca
    Accés obert
    In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades ...

Mostra'n més