2503 search results - page 157 / 501 » A study of 3-arc graphs |
196
click to vote
LICS
2008
IEEE
16 years 28 days ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
185
click to vote
VISSOFT
2005
IEEE
16 years 3 days ago
2005
IEEE
The paper presents and assesses a layout scheme for UML class diagrams that takes into account the architectural importance of a class in terms of its stereotype (e.g., boundary, ...
178
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
166
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
168
click to vote
ICTCS
2005
Springer
16 years 1 days 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...