Synthesizing designs with low-cardinality minimum feedback vertex set for partial scan application

2002 ◽  
Author(s):  
S. Dey ◽  
M. Potkonjak ◽  
R. Roy
Keyword(s):  
Feedback Vertex Set ◽  
Partial Scan ◽  
Vertex Set ◽  
Minimum Feedback Vertex Set

scholarly journals Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

2008 ◽  
Vol Vol. 10 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Hamamache Kheddouci ◽  
Olivier Togni
Keyword(s):  
Distance Graph ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Feedback Vertex Set ◽  
Distance Graphs ◽  
Vertex Set ◽  
Feedback Vertex Set Problem ◽  
International Audience ◽  
Minimum Feedback Vertex Set ◽  
Vertex Sets

Graphs and Algorithms International audience For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedback vertex set problem for some families of distance graphs and circulant graphs depending on the value of D.

New bounds on the size of the minimum feedback vertex set in meshes and butterflies

2002 ◽  
Vol 83 (5) ◽  
pp. 275-280 ◽  
Author(s):  
Ioannis Caragiannis ◽  
Christos Kaklamanis ◽  
Panagiotis Kanellopoulos
Keyword(s):  
Feedback Vertex Set ◽  
Vertex Set ◽  
Minimum Feedback Vertex Set

scholarly journals Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

2008 ◽  
Vol Vol. 10 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Hamamache Kheddouci ◽  
Olivier Togni
Keyword(s):  
Distance Graph ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Feedback Vertex Set ◽  
Distance Graphs ◽  
Vertex Set ◽  
Feedback Vertex Set Problem ◽  
International Audience ◽  
Minimum Feedback Vertex Set ◽  
Vertex Sets

Graphs and Algorithms International audience For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedback vertex set problem for some families of distance graphs and circulant graphs depending on the value of D.

A bad example for the minimum feedback vertex set problem

1985 ◽  
Vol 32 (5) ◽  
pp. 491-493 ◽  
Author(s):  
J. Donald ◽  
J. Elwin ◽  
R. Hager ◽  
P. Salamon
Keyword(s):  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem ◽  
Minimum Feedback Vertex Set

scholarly journals Minimum feedback vertex set and acyclic coloring

2002 ◽  
Vol 84 (3) ◽  
pp. 131-139 ◽  
Author(s):  
Guillaume Fertin ◽  
Emmanuel Godard ◽  
André Raspaud
Keyword(s):  
Acyclic Coloring ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Minimum Feedback Vertex Set
Sign in / Sign up

Export Citation Format

Share Document