Almost every graph is vertex-oblique

Schreyer, Jens

doi:10.1016/j.disc.2005.11.054

Search citation statements

Order By: Relevance

Paper Sections

Select...

Lemma 4 There Is a Positive Constant C Not Depending On K1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Remark 1. A stronger estimate b(k; n, p) ≤ npq for npq ≥ is claimed in [23]. A more cautious estimate is claimed in [4]: b(k; n, p) ≤ c (n + )pq for a suitable constant c.…”

Section: Lemma 4 There Is a Positive Constant C Not Depending On Kmentioning

confidence: 89%

Generic case complexity of the Graph Isomorphism Problem

Noskov

Rybalov

2016

Groups Complexity Cryptology

View full text Add to dashboard Cite

The edge test is a partial algorithm for the Graph Isomorphism Problem based on comparison the number of edges. We perform a probabilistic analysis of the efficiency of the edge test. With the binomial distribution B(n, p) on the set of inputs, we estimate the asymptotic failure probability of the edge test depending on the rate of decay of parameter p. In particular, if p ≤ , np → λ > , then the asymptotic failure probability is nonzero, so that the edge test does not solve generically the Graph Isomorphism Problem. On the other hand, if p ≤ , np → ∞, then the failure set is negligible and the edge test generically solves the Graph Isomorphism Problem in polynomial time.

show abstract

“…Remark 1. A stronger estimate b(k; n, p) ≤ npq for npq ≥ is claimed in [23]. A more cautious estimate is claimed in [4]: b(k; n, p) ≤ c (n + )pq for a suitable constant c.…”

Section: Lemma 4 There Is a Positive Constant C Not Depending On Kmentioning

confidence: 89%