Layered Graphs: A Class That Admits Polynomial Time Solutions for Some Hard Problems

doi 10.20944/preprints201805.0012.v1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

MDPI AG

Related search

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

Some Explicit Solutions for a Class of One-Phase Stefan Problems

2012English

Connected Domination Polynomial of Some Graphs

IOSR Journal of Mathematics
2016English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Polynomial Time Uniform Word Problems

Mathematical Logic Quarterly
Logic
1995English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-Criteria Optimization

English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy