Ana Silva

1. Edge-b-coloring Trees
   2015/11/17 by Víctor Campos, Ana Silva, Campos, Victor +1 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
2. Maximum cut on interval graphs of interval count four is NP-complete
   2020/12/17 by Celina M.H. de Figueiredo, de Figueiredo, Celina M. H., Alexsander A. de Melo +5 · 1 citation
   Computer Science · #05C62 #68Q17 #68Q25 #68R10 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Graph Labeling and Dimension Problems
3. On Computing Large Temporal (Unilateral) Connected Components
   2023/02/23 by Isnard Lopes Costa, Raul Lopes, Costa, Isnard Lopes +5 · 1 citation
   Computer Science · #Advanced Database Systems and Queries #Combinatorics (math.CO) #Data Management and Algorithms #FOS: Mathematics #Graph Theory and Algorithms