Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithmic aspects of bipartite graphs

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

DOI10.1155/S0161171295000378zbMath0822.68077MaRDI QIDQ1805124

Mihály Bakonyi, Erik M. Varness

Publication date: 11 May 1995

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/47261

zbMATH Keywords

Gaussian eliminationbipartite graphsedge elimination process


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1805124&oldid=14161792"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki