Search
for Author
All Reviews
Newman, Ilan
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
2
of
2
reviews
On the query complexity of testing orientations for being Eulerian
Fischer E., Lachish O., Matsliah A., Newman I., Yahalom O. ACM Transactions on Algorithms 8(2): 1-41, 2012. Type: Article
Since Leonhard Euler created graph theory, in 1736, while studying the seven bridges problem in Königsberg, testing graphs for being Eulerian has been an old and challenging problem. Graphs can be either undirected (the edges ...
...
Jun 15 2012
Optimal search in trees
Ben-Asher Y., Farchi E., Newman I. SIAM Journal on Computing 28(6): 2090-2102, 1999. Type: Article
While the problem of searching in a totally ordered set is efficiently solved by binary search, the problem of searching in a partially ordered set is much more complicated. In this paper, tree-like posets (partially ordered sets), tha...
...
Aug 1 2000
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy