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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete Applied Mathematics Ročník 158; číslo 12; s. 1268 - 1274
Hlavní autoři:	Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L.
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier B.V 28.06.2010 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!