A Lower Bound on Cycle-Finding in Sparse Digraphs

doi 10.1137/1.9781611975994.178
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

A Lower Bound on Web Services Composition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

A Lower Bound on Wait-Free Counting

Journal of Algorithms
1997English

Finding Frequent Patterns in a Large Sparse Graph

2004English

Upper Bound for the Energy of Strongly Connected Digraphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2011English

In Search of an Appropriate Lower Bound. The Zero Lower Bound vs. The Positive Lower Bound Under Discretion and Commitment

German Economic Review
EconomicsEconometrics
2019English

A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs

Journal of Graph Theory
GeometryTopology
1998English

A Lower Bound on the Probability of Error in Multihypothesis Testing

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1995English

A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane

2020English

A Lower Bound for Jumbled Indexing

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy