2430 search results - page 332 / 486 » Computing Tutte Polynomials |
173
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
175
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coiï...
174
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
173
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
208
click to vote
CPM
2009
Springer
16 years 29 days ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...