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

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-36151-0_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

SIAM Journal on Discrete Mathematics
Mathematics
2018English

Hitting Topological Minor Models in Planar Graphs Is Fixed Parameter Tractable

2020English

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2007English

An Efficient Algorithm for Density Based Subspace Clustering With Dynamic Parameter Setting

International Journal of Information Technology and Computer Science
2017English

BiCross : A Biclustering Technique for Gene Expression Data Using One Layer Fixed Weighted Bipartite Graph Crossing Minimization

International Journal of Computer Applications
2011English

An Alternative Method to Crossing Minimization on Hierarchical Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Computationally Efficient Fixed-Parameter Digital Control of Power Converters

2014English

An Efficient Total Variation Minimization Method for Image Restoration

Informatica
Applied MathematicsInformation Systems
2020English

An Energy Minimization Reconstruction Algorithm for Multivalued Discrete Tomography*

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy