6533b854fe1ef96bd12aeb0e
RESEARCH PRODUCT
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
Olivier TogniHamamache Kheddoucisubject
Discrete mathematicsGeneral Computer Science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Neighbourhood (graph theory)[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Feedback arc setTheoretical Computer ScienceCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Circulant graphChordal graphIndependent setDiscrete Mathematics and CombinatoricsMaximal independent setFeedback vertex setRegular graph[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]MathematicsMathematicsofComputing_DISCRETEMATHEMATICSdescription
Graphs and Algorithms
year | journal | country | edition | language |
---|---|---|---|---|
2008-01-01 |