Search for Author All Reviews
	Fischer, Eldar     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     The difficulty of testing for isomorphism against a graph that is given in advance Fischer E. SIAM Journal on Computing 34(5): 1147-1158, 2005.  Type: Article Consider graphs G and H. This paper investigates how many queries are required to test the input graph G for the property of being isomorphic to H. A formal de...... Feb 10 2006
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy