9842 search results - page 1585 / 1969 » The Complexity of the Matching-Cut Problem |
169
click to vote
SIGSOFT
2008
ACM
16 years 7 months ago
2008
ACM
We observed a general problem of sequential programs, which often results in design and programming errors in industrial software engineering projects, and propose a solution appr...
273
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
175
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
204
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
232
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...