2503 search results - page 323 / 501 » A study of 3-arc graphs |
175
Voted
CSL
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
150
click to vote
STACS
2007
Springer
15 years 12 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
184
click to vote
IWCMC
2006
ACM
15 years 12 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
182
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
140
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...