18 citations · 40 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021★ 6 cited
New formulations and branch-and-cut procedures for the longest induced path problem
Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro +1
Given an undirected graph , the longest induced path problem (LIPP) consists of obtaining a maximum cardinality subset such that induces a simple path i…
cs.DM2011★ 7 cited
Optimal k-fold colorings of webs and antiwebs
Manoel Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura +1
A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint…