Algorithmic aspects of bipartite graphs

We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in o...

Full description

Bibliographic Details
Main Authors:	Mihály Bakonyi, Erik M. Varness
Format:	Article
Language:	English
Published:	Hindawi Limited 1995-01-01
Series:	International Journal of Mathematics and Mathematical Sciences
Subjects:	Gaussian elimination bipartite graph perfect edge elimination fill-in.
Online Access:	http://dx.doi.org/10.1155/S0161171295000378

id	doaj-d0f1a5d7de2f4c9da697204092bd37ba
record_format	Article
spelling	doaj-d0f1a5d7de2f4c9da697204092bd37ba2020-11-24T22:47:12ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251995-01-0118229930410.1155/S0161171295000378Algorithmic aspects of bipartite graphsMihály Bakonyi0Erik M. Varness1Department of Mathematics, Georgia State University, Atlanta, GA 30303, USADepartment of Mathematics, Valparaiso University, Valparaiso, Indiana 46383, USAWe generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in of a given ordered graph.http://dx.doi.org/10.1155/S0161171295000378Gaussian eliminationbipartite graphperfect edge elimination fill-in.
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Mihály Bakonyi Erik M. Varness
spellingShingle	Mihály Bakonyi Erik M. Varness Algorithmic aspects of bipartite graphs International Journal of Mathematics and Mathematical Sciences Gaussian elimination bipartite graph perfect edge elimination fill-in.
author_facet	Mihály Bakonyi Erik M. Varness
author_sort	Mihály Bakonyi
title	Algorithmic aspects of bipartite graphs
title_short	Algorithmic aspects of bipartite graphs
title_full	Algorithmic aspects of bipartite graphs
title_fullStr	Algorithmic aspects of bipartite graphs
title_full_unstemmed	Algorithmic aspects of bipartite graphs
title_sort	algorithmic aspects of bipartite graphs
publisher	Hindawi Limited
series	International Journal of Mathematics and Mathematical Sciences
issn	0161-1712 1687-0425
publishDate	1995-01-01
description	We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in of a given ordered graph.
topic	Gaussian elimination bipartite graph perfect edge elimination fill-in.
url	http://dx.doi.org/10.1155/S0161171295000378
work_keys_str_mv	AT mihalybakonyi algorithmicaspectsofbipartitegraphs AT erikmvarness algorithmicaspectsofbipartitegraphs
_version_	1725682494859116544

Algorithmic aspects of bipartite graphs

Similar Items