Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

doi 10.1137/1.9781611974782.92
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Block Companion Matrices, Discrete-Time Block Diagonal Stability and Polynomial Matrices

Operators and Matrices
Number TheoryAnalysisAlgebra
2009English

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Recognizing Circulant Graphs of Prime Order in Polynomial Time

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1998English

Maximum Induced Forests in Graphs of Bounded Treewidth

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Deterministic Computations in Time-Varying Graphs: Broadcasting Under Unstructured Mobility

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy