Recognition Problems for Connectivity Functions
<p>A connectivity function is a symmetric, submodular set function. Connectivity functions arise naturally from graphs, matroids and other structures. This thesis focuses mainly on recognition problems for connectivity functions, that is when a connectivity function comes from a particular type of structure. In particular we give a method for identifying when a connectivity function comes from a graph, which uses no more than a polynomial number of evaluations of the connectivity function. We also give a proof that no such method can exist for matroids.</p>
2004 ◽
Vol 32
(1)
◽
pp. 41-43
◽
2020 ◽
Vol 7
(3)
◽
pp. 2114-2114
1978 ◽
Vol 3
(3)
◽
pp. 177-188
◽
2015 ◽
Vol 2
(3)
◽
pp. 84-96
◽
2015 ◽
Vol 247
(3)
◽
pp. 1013-1016
◽
2019 ◽