Complexity Results for Equistable Graphs and Related Classes
The class of equistable graphs is defined by the existence of a cost structure on the vertices such that the maximal stable sets are characterized by their costs. This graph class, not contained in any nontrivial hereditary class, has so far been studied mostly from a structural point of view; chara...
Main Authors: | Milanic, Martin, Orlin, James B., Rudolf, Gabor |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
Springer Science + Business Media B.V.
2013
|
Online Access: | http://hdl.handle.net/1721.1/77910 https://orcid.org/0000-0002-7488-094X |
Similar Items
-
Connectivity and related properties for graph classes
by: Weller, K, et al.
Published: (2014) -
An O(Nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph
by: Sedeno-Noda, Antonio, et al.
Published: (2018) -
Rainbow Graphs and Switching Classes
by: Oh, Suho, et al.
Published: (2013) -
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004) -
Querying and mining complex graphs : uncertainty and multi-relations
by: Ke, Xiangyu
Published: (2020)