Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Authors

  • Mauro Mezzini

DOI:

https://doi.org/10.7155/jgaa.00144

Keywords:

graph algorithm , algebraic set , summary data

Abstract

A set of edges of a hypergraph H is an algebraic set if its characteristic vector can be expressed as a linear combination of rows of the (node-edge) incidence matrix of H. Recently it was proven that deciding whether or not a given edge-set of H contains a non-empty algebraic set is an NP-complete problem. In this paper we give a linear time algorithm to decide if a given edge-set contains a non-empty algebraic set when the hypergraph is a graph.

Downloads

Download data is not yet available.

Downloads

Published

2007-01-01

How to Cite

Mezzini, M. (2007). Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time. Journal of Graph Algorithms and Applications, 11(1), 239–257. https://doi.org/10.7155/jgaa.00144

Issue

Section

Articles

Categories