scientific article; zbMATH DE number 1786153

MaRDI QIDQ4547477zbMATHFDO

Authors Štefan Berežný, Katarina Cechlárová, Vladimír Lacko

Publication date 30 January 2003

zbMATH Keywords

matchingNP-completenessspanning treepathtravelling salesman problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Balanced problems on graphs with categorization of edges
• Minimum perfect bipartite matchings and spanning trees under categorization
• Traveling salesman problem under categorization
• scientific article; zbMATH DE number 4045507
• scientific article; zbMATH DE number 3873380

Cited in

(8)

• Traveling salesman problem under categorization
• Balanced problems on graphs with categorization of edges
• scientific article; zbMATH DE number 4179413 (Why is no real title available?)
• On the \(O(n^{3})\) algorithm for checking the strong robustness of interval fuzzy matrices
• Optimality program in segment and string graphs
• Minimum perfect bipartite matchings and spanning trees under categorization
• The color-balanced spanning tree problem.
• Some graph optimization problems with weights satisfying linear constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547477)