19 search results - page 4 / 4 » Computing Minimum Directed Feedback Vertex Set in O(1.9977n) |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
SI3D
2003
ACM
14 years 18 days ago
2003
ACM
We present a tool for the user-controlled creation of multiresolution meshes. Several automatic mesh reduction methods of high quality have been presented in the past, but most of...