[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

On the time required to recognize properties of graphs: a problem

Published: 01 October 1973 Publication History

Abstract

No abstract available.

Reference

[1]
R. C. Holt and E. M. Reingold, On the time required to detect cycles and connectivity in graphs. Math. Systems Theory 6 (1972) 103--106.

Cited By

View all
  • (2024)Query complexity of tournament solutionsTheoretical Computer Science10.1016/j.tcs.2024.114422991(114422)Online publication date: Apr-2024
  • (2023)Elusive properties of infinite graphsJournal of Graph Theory10.1002/jgt.23042105:3(427-450)Online publication date: 26-Oct-2023
  • (2022)Counting Small Induced Subgraphs Satisfying Monotone PropertiesSIAM Journal on Computing10.1137/20M136562453:6(FOCS20-139-FOCS20-174)Online publication date: 11-Apr-2022
  • Show More Cited By
  1. On the time required to recognize properties of graphs: a problem

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM SIGACT News
    ACM SIGACT News  Volume 5, Issue 4
    October 1973
    9 pages
    ISSN:0163-5700
    DOI:10.1145/1008299
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 October 1973
    Published in SIGACT Volume 5, Issue 4

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)90
    • Downloads (Last 6 weeks)9
    Reflects downloads up to 17 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Query complexity of tournament solutionsTheoretical Computer Science10.1016/j.tcs.2024.114422991(114422)Online publication date: Apr-2024
    • (2023)Elusive properties of infinite graphsJournal of Graph Theory10.1002/jgt.23042105:3(427-450)Online publication date: 26-Oct-2023
    • (2022)Counting Small Induced Subgraphs Satisfying Monotone PropertiesSIAM Journal on Computing10.1137/20M136562453:6(FOCS20-139-FOCS20-174)Online publication date: 11-Apr-2022
    • (2022)Nearly Optimal Communication and Query Complexity of Bipartite Matching2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00113(1174-1185)Online publication date: Oct-2022
    • (2020)Elusiveness of finding degreesDiscrete Applied Mathematics10.1016/j.dam.2019.06.009286(128-139)Online publication date: Nov-2020
    • (2019)Handling Massive N-Gram Datasets EfficientlyACM Transactions on Information Systems10.1145/330291337:2(1-41)Online publication date: 11-Feb-2019
    • (2019)Fine-grained Geolocation of Tweets in Temporal ProximityACM Transactions on Information Systems10.1145/329105937:2(1-33)Online publication date: 11-Jan-2019
    • (2018)Time and space efficient quantum algorithms for detecting cycles and testing bipartitenessQuantum Information & Computation10.5555/3370185.337018718:1-2(18-50)Online publication date: 1-Feb-2018
    • (2018)Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)Journal of the ACM10.1145/323253665:6(1-24)Online publication date: 22-Nov-2018
    • (2017)Query complexity of tournament solutionsProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298483.3298669(2992-2998)Online publication date: 4-Feb-2017
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media