A generalized “wave” method for solving extremal problems on graphs

From MaRDI portal

Revision as of 18:48, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3875952

Jump to:navigation, search

DOI10.1016/0041-5553(79)90139-3zbMath0436.05034OpenAlexW2086433069WikidataQ57570095 ScholiaQ57570095MaRDI QIDQ3875952

Sergei M. Avdoshin, Vladimir V. Belov

Publication date: 1980

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(79)90139-3

zbMATH Keywords

algorithm bipartite graph extremal problems flow graph greatest pair combination multi-iteration problems optimization complex of a graph wave subgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: A generalized “wave” method for solving extremal problems on graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3875952&oldid=17506175"