The convex weighting of a graph and an alternative definition of a matroid

DOI10.1016/0012-365X(84)90132-8MaRDI QIDQ787997zbMATH OpenFDO

Authors Meigu Guan, Weixuan Li, Zheming Wang

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

weight functionmatroid base graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Recommendations

• On the \(K\)th best base of a matroid
• A new exchange property for matroids and its application to max-min-problems
• Two algorithms for weighted matroid intersection
• Publication:4724652
• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• A combinatorial ranking problem
• Graph theory

Cited in

(1)

• On the \(K\)th best base of a matroid

This page was built for publication: The convex weighting of a graph and an alternative definition of a matroid

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