9532 search results - page 126 / 1907 » Logic, Graphs, and Algorithms |
ISMVL
2000
IEEE
15 years 3 months ago
2000
IEEE
— This paper analyses the propagation operations of signal’s multiple-valued behavior while passing through the basic gates. Based on it the propagation algorithm of behavior p...
108
click to vote
ENC
2004
IEEE
15 years 3 months ago
2004
IEEE
A method to induce bayesian networks from data to overcome some limitations of other learning algorithms is proposed. One of the main features of this method is a metric to evalua...
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
ICALP
2000
Springer
15 years 2 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...