scientific article; zbMATH DE number 7564191

MaRDI QIDQ5091535zbMATH OpenFDO

Authors Grega Cigler, Julio C. Urenda, Vladik Kreinovich, Piotr Wojciechowski

Publication date 26 July 2022

zbMATH Keywords

\(G\)-solubility of a graphweighted graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computing and Combinatorics
• scientific article; zbMATH DE number 5178701
• Algorithms for finding clique-transversals of graphs
• Solvability of Graph Inequalities
• scientific article; zbMATH DE number 4075093
• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
• An Extremal Graph Problem with a Transcendental Solution
• On best transitive approximations to simple graphs
• Algorithmic Solution of Extremal Digraph Problems
• An algorithm for transitive reduction of an acyclic graph

Cited in

(3)

• Transitive systems and conclusive partial orders
• Computing and Combinatorics
• Algebraic properties of soluble posets

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 Q5091535)