Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graphenalgorithmen und Überdeckungsprobleme

From MaRDI portal
Publication:1844705
Jump to:navigation, search

DOI10.1007/BF02246611zbMATH Open0284.68030OpenAlexW365280528MaRDI QIDQ1844705FDOQ1844705


Authors: Yanyan Li Edit this on Wikidata


Publication date: 1974

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02246611





Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)


Cites Work

  • Title not available (Why is that?)
  • Covering Problems: Duality Relations and a New Method of Solution
  • Ein reduzierter Matrix-Algorithmus zur Lösung einiger graphentheoretischer Probleme. (A reduced matrix algorithm for solving some graph-theoretical systems.)
  • Anwendung von Graphenalgorithmen auf allgemeinere Problemklassen






This page was built for publication: Graphenalgorithmen und Überdeckungsprobleme

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1844705&oldid=14222564"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 10:47. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki