Now showing items 1-8 of 8

  • An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs 

    Abiad, Aida; Fiol Mora, Miquel Àngel; Haemers, Willem H.; Perarnau Llobet, Guillem (2014)
    Conference report
    Open Access
    We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by ...
  • Búsqueda de comunidades en grafos grandes mediante configuraciones implícitas de vectores 

    Muntés Mulero, Víctor; Padrol Sureda, Arnau; Perarnau Llobet, Guillem; Pfeifle, Julián (PUBL. UNIVERSIDAD DE ZARAGOZA, 2009)
    Conference report
    Open Access
    Presentamos el algoritmo OCA para buscar comunidades solapadas en grafos grandes, como por ejemplo la Wikipedia con 1,6×107 nodos y 1,8×108 aristas. OCA se basa en la búsqueda iterativa de subconjuntos localmente óptimos ...
  • Continuous symmetry and shape measures 

    Perarnau Llobet, Guillem; Pfeifle, Julián; Saludes Closa, Jordi (Centre de Recerca Matemàtica, 2010-06)
    Part of book or chapter of book
    Open Access
  • Desenvolupament d'una càmera digital per a la visió estéreo en temps real. 

    Lisa-Mingo, Ferran; Perarnau Llobet, Guillem (2008-12-04)
    Audiovisual
    Open Access
  • Matchings in random biregular bipartite graphs 

    Perarnau Llobet, Guillem; Petridis, Georgios (2013-03-24)
    Article
    Open Access
    We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdös and Rényi about perfect matchings in random ...
  • On the tree depth of random graphs 

    Perarnau Llobet, Guillem; Serra Albó, Oriol (2010)
    Conference report
    Restricted access - publisher's policy
    The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expansion classes and has been introduced under numerous names. We describe the asymptotic behaviour of this parameter in the ...
  • Overlapping community search for social networks 

    Padrol Sureda, Arnau; Perarnau Llobet, Guillem; Pfeifle, Julián; Muntés Mulero, Víctor (IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
    Conference report
    Open Access
    Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes, real-world datasets suggest the presence ...
  • Probabilistic methods and coloring problems in graphs 

    Perarnau Llobet, Guillem (Universitat Politècnica de Catalunya, 2010-06)
    Master thesis
    Open Access
    Aquest projecte està dedicat a estudiar el k-èssim nombre cromàtic generalitzat que sorgeix de les descomposicions Low Tree--Depth en grafs usant mètodes probabilístics.. Una extensió natural del nombre cromàtic d'un graf ...