33 search results - page 4 / 7 » Minimum cycle bases of graphs on surfaces |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
UAI
2008
14 years 11 months ago
2008
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
DATE
2006
IEEE
15 years 1 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
TAMC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...