An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*

ISSN： 0209-9683

Source： Combinatorica, Vol.26, Iss.2, 2006-04, pp. : 207-230

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance

By He Yong Zhang Binwu Yao Enyu

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 91-100

Springer Publishing Company

Access to resources Recommend Favorite

A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks

By Saks* Michael Samorodnitsky† Alex Zosin† Leonid

Combinatorica, Vol. 24, Iss. 3, 2004-07 ,pp. : 525-530

Springer Publishing Company

Access to resources Recommend Favorite

Lower-Bound Estimates for Poisson-Type Approximations

By Cekanavicius V.

Lithuanian Mathematical Journal, Vol. 45, Iss. 4, 2005-10 ,pp. : 405-423

Springer Publishing Company

Access to resources Recommend Favorite

A Wowzer-type lower bound for the strong regularity lemma

By Kalyanasundaram Subrahmanyam Shapira Asaf

Proceedings of the London Mathematical Society, Vol. 106, Iss. 3, 2013-03 ,pp. : 621-649

Oxford University Press

Access to resources Recommend Favorite

A lower bound for certain Ramsey type problems

By Tejaswi N.V. Thangadurai R.

Quaestiones Mathematicae, Vol. 25, Iss. 4, 2002-12 ,pp. : 445-451

Taylor & Francis Ltd

Access to resources Recommend Favorite