scientific article

From MaRDI portal

Revision as of 00:52, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3999693

Jump to:navigation, search

zbMath0723.68084MaRDI QIDQ3999693

M. I. Nechepurenko, S. M. Majnagashev, S. B. Kaul, A. B. Gryzunov, V. A. Proskuryakov, V. A. Kokhov, V. K. Popkov

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

covering embedding colouring packing connectivity network optimization graph isomorphism graph representation crossing paths in graphs flows in networks stochastic graphs graph generation and transformation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

Particular Structures of the Pareto Set and Its Reduction in Bicriteria Discrete Problems ⋮ Two approaches to determining similarity of two digraphs ⋮ The reduction of the Pareto set of a special structure in bicriteria discrete problems

Uses Software

PL/I

This page was built for publication:

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