scientific article; zbMATH DE number 1786153

zbMATH Open1003.90525MaRDI QIDQ4547477FDOQ4547477

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

Publication date: 30 January 2003

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• Traveling salesman problem under categorization
• On the \(O(n^{3})\) algorithm for checking the strong robustness of interval fuzzy matrices
• Optimality program in segment and string graphs
• Balanced problems on graphs with categorization of edges
• Some graph optimization problems with weights satisfying linear constraints
• Minimum perfect bipartite matchings and spanning trees under categorization
• Title not available (Why is that?)
• Title not available (Why is that?)

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)