656 search results - page 53 / 132 » Graph Theoretical Characterization and Computation of Answer... |
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
CSE
2009
IEEE
13 years 5 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
IDA
2011
Springer
13 years 2 months ago
2011
Springer
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...