Enviaments recents

  • Simple and efficient tree comparison 

    Valiente Feruglio, Gabriel Alejandro (2001-01-08)
    Report de recerca
    Accés obert
    A new distance metric for rooted trees is presented which is based on the largest common forest of two rooted trees. The new measure is superior to previous measures based on tree edit distance, because no particular ...
  • Tree edit distance and common subtrees 

    Valiente Feruglio, Gabriel Alejandro (2002-02)
    Report de recerca
    Accés obert
    The relationship between tree edit distance and maximum common subtrees is established, showing that a tree edit distance constrained by insertion and deletions on leaves only and by a simple condition on the cost of ...
  • Exponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs 

    Hajiaghayi, Mohammad Taghi; Demaine, Erik D.; Thilikos Touloupas, Dimitrios (2002-03)
    Report de recerca
    Accés obert
    We present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K_{5} or K_3,3 as a minor in time O(3^{6sqrt{34 k}}n^{O(1)}). In fact, we present our ...
  • Classes of term rewrite systems with polynomial confluence problems 

    Godoy Balil, Guillem; Nieuwenhuis, Robert Lukas Mario (2002-06-06)
    Report de recerca
    Accés obert
    The confluence property of ground (i.e., variable-free) term rewrite systems (GTRS) is well-known to be decidable. This was proved independently in [DTHL87,DHLT90] and in [Oya87] using tree automata techniques and ground ...
  • Bounds on the max and min bisection of random cubic and 4-regular graphs 

    Díaz Cort, Josep; Do, Norman; Serna Iglesias, María José; Wormald, Nick (2002-12)
    Report de recerca
    Accés obert
    In this paper we present simple randomized algorithms to bisect cubic and 4-regular graphs. These algorithms produce bisections of size asymptotically at most 0.17404n for typical random cubic n-vertex graphs, and ...
  • A Random graph model for optical networks of sensors 

    Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José (2002-12)
    Report de recerca
    Accés obert
    In this paper we propose a model for Smart Dust Networks and show its applicability when the goal of the network is monitoring an area under the surveillance of a base station. We analyze basic parameters of these nets and ...
  • Where should concurrent rotations take place to rebalance a distributed arbitrary search tree? 

    Bougé, Luc; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier (1996-01)
    Report de recerca
    Accés obert
    We address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL trees). We show that this problem can be studied through the self-reorganization of distributed systems of processes ...
  • 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 PgaFrame - a frame for parallel genetic algorithms 

    Petit Silvestre, Jordi (1997-05)
    Report de recerca
    Accés obert
    The PgaFrame offers to non-expert users the possibility to solve optimization problems via genetic algorithms on parallel computers. This frame has appeared as the natural fusion of two different projects: PgaPack and ...
  • The Frames poster 

    Petit Silvestre, Jordi; Thomas, Roemke (1997-01)
    Report de recerca
    Accés obert
    This is the poster made to support the software demonstration of Frames in the ALCOM-IT meeting to be held in Cologne in January 1997. The poster points out the main highlights of the software system, as well as the ...

Mostra'n més