Home * People * Pablo San Segundo
San_segundo_carrillo_pablo_20081119_olympiade_dresden.jpg

Pablo San Segundo Carrillo,
a Spanish chess grandmaster, Spanish chess champion in 1997 and member of the Olympic team since 1994, computer scientist and associate professor at the Universidad Politécnica de Madrid (UPM). His research interests include heuristics, combinatorics, game- and graph theory, and AI search- and optimization problems in general, specially applying bitboards. In their 2005 paper, Bitboards: A New Approach [1] , Pablo San Segundo and Ramón Galán mention Bitscan by Modulo for finding 1-bits in a very efficient and practically no space consuming way, at that time not aware of De Bruijn multiplication as proposed by Charles Leiserson et al. in 1998 [2], which is however mentioned in Segundo et al. 2011 on BBMC [3].
Pablo San Segundo [4]

BITSCAN

Pablo San Segundo has recently released BITSCAN [5], an efficient C++ library for bitstrings which is optimized for scanning bit vectors of any size, and which he used to implement BBMC (BB-MaxClique), a state of the art maximum clique algorithm [6]. BBMC encodes the graph problem as bitstrings and uses bitmasks to implement the basic computations in the search. BITSCAN is publicly available as part of the Biicode repository [7] [8], a package manager for software developers. Comparisons of time performance between BITSCAN, Boost as well as STL bitstring implementations are available [9].

GRAPH

GRAPH, a small C++ library with a number of data types for bit-encoded graphs [10] [11] using BITSCAN has now been released.
ugraph-pablo-exmple-bitstring.png
The figure shows a simple undirected graph with 6 vertices (in red a 3-clique) [12]
At the moment it is in alpha, but here are some features:
  • Specific types for sparse bit encoded graphs [13]
  • Uniform random graph generation (contains state of the art efficient generator for sparse graphs)
  • k-Core decomposition analysis [14]
  • Maximum clique solver for massive networks [15]

Selected Publications

[16] [17]

External Links


References

  1. ^ Pablo San Segundo, Ramón Galán (2005). Bitboards: A New Approach. AIA 2005
  2. ^ Charles E. Leiserson, Harald Prokop, Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word. pdf
  3. ^ Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez (2011). An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research, Vol. 38, No. 2, 2 Preliminaries 2.2 Bit-parallel computation
  4. ^ Pablo San Segundo at the 38th Chess Olympiad, Dresden 2008, Photo by Frank Hoppe, Pablo San Segundo Carrillo from Wikipedia.es (Spanish)
  5. ^ Biicode: Pablo San Segundo - BITSCAN
  6. ^ Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez (2011). An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research, Vol. 38, No. 2
  7. ^ Biicode: C++ dependency manager
  8. ^ biicode Blog - Almost daily C and C++ jibby jabba
  9. ^ BITSCAN efficiency at a glance by biicode Team, July 4, 2014
  10. ^ Biicode: Pablo San Segundo - GRAPH library for bit-encoded graphs
  11. ^ Bit encoded Graphs by Pablo San Segundo, July 31, 2014
  12. ^ Bit encoded Graphs by Pablo San Segundo, July 31, 2014
  13. ^ Sparse bitsets in C++ with BITSCAN by Pablo San Segundo, September 23, 2014
  14. ^ Determining k-cores in a network: a new BITSCAN application by Pablo San Segundo, September 4, 2014
  15. ^ Maximum clique for massive sparse graphs by Pablo San Segundo, February 24, 2015
  16. ^ DBLP: Pablo San Segundo
  17. ^ Pablo San Segundo | ResearchGate
  18. ^ Clique problem from Wikipedia

What links here?


Up one Level