6 citations · 7 across the 5 of their papers we have counts for
3 papers · 1 filter
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators
Boi Faltings, Martin Charles Golumbic
Partitioning a graph using graph separators, and particularly clique separators, are well-known techniques to decompose a graph into smaller units which can be treated independentl…
Containment Graphs, Posets, and Related Classes of Graphs
Martin Charles Golumbic, Edward R. Scheinerman
In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let be a family of nonempty sets. We call a (s…
The Complexity of Helly- EPG Graph Recognition
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos +2
Golumbic, Lipshteyn, and Stern defined in 2009 the class of EPG graphs, the intersection graph class of edge paths on a grid. An EPG graph is a graph that admits a representati…