Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP

Proceedings of the American Mathematical Society - United States
doi 10.2307/2160785
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A PTAS for Subset TSP in Minor-Free Graphs

2020English

Characterizations of Certain Types of Type 2 Soft Graphs

Discrete Dynamics in Nature and Society
ModelingSimulation
2018English

A Class of Weakly Perfect Graphs

Czechoslovak Mathematical Journal
Mathematics
2010English

A Note on Solvable Vertex Stabilizers of S-Transitive Graphs of Prime Valency

Czechoslovak Mathematical Journal
Mathematics
2015English

A Class of Blocks Behaving Like Blocks of P-Solvable Groups

Journal of Algebra
Number TheoryAlgebra
2006English

Class Field Theory of Solvable Algebraic Number Fields

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1939English

A New Weibull Class of Distributions: Theory, Characterizations and Applications

Journal of Statistical Research of Iran
2018English

Proper Augmented Marked Graphs : Properties, Characterizations and Applications

Information Technology and Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy