Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
SIGACT News October ON THE TIME REQUIRED TO RECOGNIZE PROPERTIES OF GRAPHS: A Problem Arnold L. Rosenberg Mathematical Sciences Department IBM Watson Research Center Yorktown Heights, New York In a recent paper H-R Theorems. which, [i], Holt and Reingold have proved the following results. Let graphs be presented via their incidence matrices. Any algorithm given an n-node graph, (resp., contains detects whether or not the graph is strongly case probe 0(n 2) entries connected a cycle) must in the worst of the incidence matrix. Here, a "probe" is used to detect the presence or absence of edge attractive . A glance at a proof of these results conjecture. Definition. (a) A property For each P renders the following of graphs is natural if is true of some n-node graph and false of naN, P some n-node graph. (b) P is invariant under graph-isomorphism (= renaming of nodes). Let False Conjecture. P Let graphs be presented via their incidence matrices. of graphs. Any algorithm which, property P be any natural property given an n-node must in the worst graph, detects whether or not the graph enjoys 0(n 2) entries case probe of the incidence matrix. Our lack Ray Strong
ACM SIGACT News – Association for Computing Machinery
Published: Oct 1, 1973
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.