An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

ISSN： 0178-4617

Source： Algorithmica, Vol.40, Iss.1, 2004-06, pp. : 15-31

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

Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable

By Kelk Steven Scornavacca Celine

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 886-915

Springer Publishing Company

Access to resources Recommend Favorite

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

By Fellows M. Knauer C. Nishimura N. Ragde P. Rosamond F. Stege U. Thilikos D. Whitesides S.

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 167-176

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Server Minimization Algorithm for Internet Distributed Systems

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 4, Iss. 4, 2017-10 ,pp. : 17-30

IGI Global_journal

Access to resources Recommend Favorite

A fixed-parameter algorithm for minimum quartet inconsistency

By Gramm J. Niedermeier R.

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 723-741

Elsevier

Access to resources Recommend Favorite

A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations

By Zhou B.B. Brent R.P.

Journal of Parallel and Distributed Computing, Vol. 42, Iss. 1, 1997-04 ,pp. : 1-10

Academic Press

Access to resources Recommend Favorite