A constraint programming approach to cutset problems
From MaRDI portal
Publication:2489126
DOI10.1016/j.cor.2005.01.014zbMath1086.90054MaRDI QIDQ2489126
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.014
90C35: Programming involving graphs or networks
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On locating minimum feedback vertex sets
- A greedy randomized adaptive search procedure for the feedback vertex set problem
- Constraint programming: strategic directions
- Feedback vertex sets and cyclically reducible graphs
- A contraction algorithm for finding small cycle cutsets
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
- Robust linear algorithms for cutsets
- A polyhedral approach to the feedback vertex set problem