Guillaume Bagan |  Nicolas Bousquet... -  《Graph-Theoretic Concepts in Computer Science》 -  International Workshop on Graph-Theoretic Concepts in Computer Science - 2025, - 21～34 - 共14页

摘要：Dominating sets in graphs are often used to model monitoring problems, by posting guards on the vertices of the dominating set. If an (unguarded) vertex is attacked, at least one guard can then react ...

关键词： Eternal dominating set |  Treedepth |  PSPACE-completeness |  Parameterized complexity

Guillaume Bagan |  Houcine Boumediene-M...... -  《Discrete Applied Mathematics》 - 2017,230 - 34～50 - 共17页 - 被引量：5

摘要： Abstract...

关键词： Dominator coloring |  Total dominator coloring |  Dominated coloring |  Strong coloring |  Strict strong coloring

Guillaume Bagan |  Angela Bonifati... -  《2017 IEEE 33rd International Conference on Data Engineering: IEEE 33rd International Conference on Data Engineering (ICDE 2017), 19–22 April 2017, San Diego, California, USA》 -  IEEE International Conference on Data Engineering - 2017, - 63～64 - 共2页

摘要：Abstract-Massive graph data sets are pervasive in contemporary application domains. Hence, graph database systems are becoming increasingly important. In the experimental study of these systems, it is...

关键词： Benchmark testing |  Query processing |  Generators |  Database languages |  Estimation

Guillaume Bagan |  Angela Bonifati... -  《IEEE Transactions on Knowledge and Data Engineering》 - 2017,29(4) - 856～869 - 共14页 - 被引量：28

摘要：Massive graph data sets are pervasive in contemporary application domains. Hence, graph database systems are becoming increasingly important. In the experimental study of these systems, it is vital th...

关键词： Benchmark testing |  Query processing |  Database languages |  Estimation |  Generators

Guillaume Bagan |  George H. L. Fletche...... -  《2017 IEEE 33rd International Conference on Data Engineering : [Volume 1 of 2] Pages 1-808.》 -  International Conference on Data Engineering - 2017, - 63～64 - 共2页

摘要：Massive graph data sets are pervasive in contemporary application domains. Hence, graph database systems are becoming increasingly important. In the experimental study of these systems, it is vital th...

关键词： gMark: Schema-Driven |  Generation |  Queries

NSTL主题词： Generations

Guillaume Bagan |  Olivier Cogis... -  《Algorithmic operations research》 - 2009,4(2) - 95～101 - 共7页

摘要：In all-optical networks, several communications can be transmitted through the same fiber link provided that they usedifferent wavelengths. The MINIMUM ALL-OPTICAL ROUTING problem (given a list of pai...

关键词： minimum load routing |  minimum path colouring |  all-optical networks |  mesh |  1-turn routing |  approximationalgorithms

Guillaume Bagan |  Arnaud Durand... -  《RAIRO theoretical informatics and applications》 - 2008,42(1) - 147～164 - 共18页

摘要：We design algorithms of "optimal" data complexity for several natural problems about first-order queries on structures of bounded degree. For that purpose, we first introduce a framework to deal with ...

关键词： complexity of enumeration |  first-order queries |  structures of bounded degree |  linear time |  constant time |  constant delay

Guillaume Bagan |  Eric Duchêne... -  《Algorithmica》 - 2025,87(2) - 191～222 - 共32页

摘要：Abstract The MakerBreaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has not yet been...

Guillaume Bagan |  George H. L. Fletche...... -  《42nd international conference on very large data bases, part 3: 42nd international conference on very large data bases (VLDB 2016), 5-9 September 2016, New Delhi, India》 -  International conference on very large data bases - 2016, - 1457～1460 - 共4页

摘要：Graph data management tools are nowadays evolving at a great pace. Key drivers of progress in the design and study of data intensive systems are solutions for synthetic generation of data and workload...

NSTL主题词： graphic library |  Workload |  Database |  FLEXIBLE

Guillaume Bagan |  Amaud Durand... -  《Computer Science Logic》 -  International Workshop on Computer Science Logic (CSL 2010) - 2010, - 80～94 - 共15页

摘要：We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X{bottom}_ property. Tree-like relations such as XPath axes or grids are na...