Complexity results related to monophonic convexity

The study of monophonic convexity is based on the family of induced paths of a graph. The closure of a subset X of vertices, in this case, contains every vertex v such that v belongs to some induced path linking two vertices of X . Such a closure is called monophonic closure. Likewise, the convex hu...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 158; no. 12; pp. 1268 - 1274
Main Authors:	Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Kidlington Elsevier B.V 28.06.2010 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Convex and discrete geometry Exact sciences and technology Geometry Information retrieval. Graph m-convex set m-convexity number m-hull number Mathematics Monophonic convexity Monophonic number Sciences and techniques of general use Theoretical computing Monophonic number m-convexity number m-convex set Monophonic convexity m-hull number Vertex Convex set Graph path Closure Computer theory Computing Computational complexity Optimization Polynomial time Convex hull Maximum Convexity Combinatorics
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!