Strong-mixed searching and pathwidth

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.13, Iss.1, 2007-01, pp. : 47-59

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

Directed Path-width and Monotonicity in Digraph Searching

By Barát János

Graphs and Combinatorics, Vol. 22, Iss. 2, 2006-06 ,pp. : 161-172

Springer Publishing Company

Access to resources Recommend Favorite

Approximation of pathwidth of outerplanar graphs

By Bodlaender H.L. Fomin F.V.

Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. : 190-200

Academic Press

Access to resources Recommend Favorite

Circumference and Pathwidth of Highly Connected Graphs

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 3, 2015-07 ,pp. : 222-232

John Wiley & Sons Inc

Access to resources Recommend Favorite

Searching for evolutions from pure states into mixed states with entangled neutral kaons

By Gerber H.-J.

The European Physical Journal C - Particles and Fields, Vol. 32, Iss. 2, 2004-01 ,pp. : 229-233

Springer Publishing Company

Access to resources Recommend Favorite

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

By Bodlaender H.L. Kloks T.

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 358-402

Academic Press

Access to resources Recommend Favorite