Sciweavers

522 search results - page 12 / 105
» The 3-Steiner Root Problem
Sort
View
COCOON
2003
Springer
14 years 1 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
ICCBR
2009
Springer
14 years 1 months ago
Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge
Oil well drilling is a complex process which frequently leads to operational problems. In order to deal with some of these problems, knowledge intensive case based reasoning (KiCBR...
Samad Valipour Shokouhi, Agnar Aamodt, Pål S...
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
14 years 23 days ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
ALGORITHMICA
2006
100views more  ALGORITHMICA 2006»
13 years 8 months ago
Error Compensation in Leaf Power Problems
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...