882 search results - page 45 / 177 » On the Hardness of Graph Isomorphism |
WINE
2010
Springer
13 years 6 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
ICAC
2006
IEEE
14 years 3 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
FOCS
2004
IEEE
14 years 20 days ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
AI
2006
Springer
13 years 9 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
WG
2010
Springer
13 years 7 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...