An O(n3)-Time Recognition Algorithm for hhds-free Graphs

Author： Eschen Elaine   Hoàng Chính   Sritharan R.  

Publisher： Springer Publishing Company

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.1, 2007-06, pp. : 209-231

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

An O(n 2) active set algorithm for the solution of a parametric quadratic program

By Gómez Manuel  

Numerical Algorithms, Vol. 22, Iss. 3-4, 1999-02 ,pp. : 305-316

Springer Publishing Company

Access to resources Recommend Favorite

Synthesis and structure of a terephthalato-bridged nickel complex [Ni(tpt)(imi)3(H2O)]n

By Zhang Quanzheng   Lu Canzhong  

Journal of Chemical Crystallography, Vol. 35, Iss. 12, 2005-12 ,pp. : 965-968

Springer Publishing Company

Access to resources Recommend Favorite

Synthesis and crystal structure of a phthalate-bridged copper(II) complex {[Cu(L)(Phen)(H2O)]⋅H2O}n

By Ye Chao-Hong   Sun Hao-Ling   Wang Xin-Yi   Huang Rui-Li   Li Jun-Ran   Gao Song  

Journal of Chemical Crystallography, Vol. 35, Iss. 5, 2005-05 ,pp. : 381-384

Springer Publishing Company

Access to resources Recommend Favorite

Exact 3-Satisfiability Is Decidable in Time O(20.16254n)

By Porschen Stefan   Randerath Bert   Speckenmeyer Ewald  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 173-193

Springer Publishing Company

Access to resources Recommend Favorite

Exact 3-satisfiability is decidable in time O(20.16254n )

By Porschen Stefan   Randerath Bert   Speckenmeyer Ewald  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 173-193

Springer Publishing Company

Access to resources Recommend Favorite