Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

E-ISSN： 1097-0118|79|4|282-299

ISSN： 0364-9024

Source： JOURNAL OF GRAPH THEORY, Vol.79, Iss.4, 2015-08, pp. : 282-299

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

Abstract

Related content

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

By Chazelle B. Matousek J.

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 579-597

Academic Press

Access to resources Recommend Favorite

The scattering number of thorn graphs

By Kirlangiç Alpay Aytaç Aysun Ozan

International Journal of Computer Mathematics, Vol. 81, Iss. 3, 2004-03 ,pp. : 299-311

Taylor & Francis Ltd

Access to resources Recommend Favorite

Computing the Scattering Number of Graphs

By Zhang Shenggui Li Xueling Han Xinglou

International Journal of Computer Mathematics, Vol. 79, Iss. 2, 2002-01 ,pp. : 179-187

Taylor & Francis Ltd

Access to resources Recommend Favorite

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. : 73-98

John Wiley & Sons Inc

Access to resources Recommend Favorite

A note on chromatic number and connectivity of infinite graphs

By Komjáth Péter

Israel Journal of Mathematics, Vol. 196, Iss. 1, 2013-08 ,pp. : 499-506

Springer Publishing Company

Access to resources Recommend Favorite