Sciweavers

310 search results - page 39 / 62
» dam 2008
Sort
View
DAM
2008
134views more  DAM 2008»
13 years 10 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
DAM
2008
111views more  DAM 2008»
13 years 10 months ago
Games played by Boole and Galois
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
Aviezri S. Fraenkel
DAM
2008
103views more  DAM 2008»
13 years 10 months ago
Crown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
Miroslav Chlebík, Janka Chlebíkov&aa...
DAM
2008
103views more  DAM 2008»
13 years 10 months ago
Counting preimages of TCP reordering patterns
Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial pro...
Anders Hansson, Gabriel Istrate
DAM
2008
92views more  DAM 2008»
13 years 10 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi