scientific article
From MaRDI portal
Publication:3348434
zbMath0726.68062MaRDI QIDQ3348434
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Graph theory (05C99) Discrete mathematics in relation to computer science (68R99)
Related Items (14)
Coloured matchings in bipartite graphs ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ EP theorems and linear complementarity problems ⋮ Coloring vertices of a graph or finding a Meyniel obstruction ⋮ Balanced matrices ⋮ Exponentiality of the exchange algorithm for finding another room-partitioning ⋮ On existence theorems ⋮ The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems ⋮ Unnamed Item ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ EP theorem for dual linear complementarity problems ⋮ Some graphic uses of an even number of odd nodes ⋮ On balanced graphs ⋮ Colouring Some Classes of Perfect Graphs Robustly
This page was built for publication:
