M
Martin Farber
Researcher at University of Waterloo
Publications - 11
Citations - 1224
Martin Farber is an academic researcher from University of Waterloo. The author has contributed to research in topics: Chordal graph & Strongly chordal graph. The author has an hindex of 11, co-authored 11 publications receiving 1158 citations. Previous affiliations of Martin Farber include Bell Labs.
Papers
More filters
Journal ArticleDOI
Characterizations of strongly chordal graphs
TL;DR: Several characterizations of the class of strongly chordal graphs are presented, including a forbidden induced subgraph characterization and two characterizations in terms of totally balanced matrices, which yields a polynomial recognition algorithm.
Journal ArticleDOI
Domination, independent domination, and duality in strongly chordal graphs☆
TL;DR: Polynomial algorithms to locate minimum weight dominating sets and independent dominating sets in strongly chordal graphs and to efficiently solve certain optimization problems for totally balanced matrices are presented.
Journal ArticleDOI
Steiner trees, connected domination and strongly chordal graphs
TL;DR: A polynomial algorithm and a min-max theorem for the cardinality Steiner problem in strongly chordal graphs and a polynometric algorithm for the weighted connected dominating set problem in series-parallel graphs are given.
Journal ArticleDOI
Characterizations of totally balanced matrices
Richard P. Anstee,Martin Farber +1 more
TL;DR: Efficient recognition algorithms for totally balanced matrices are presented and a new completion algorithm for building a maximal totally balanced matrix from an arbitraryotally balanced matrix follows from these results.
Journal ArticleDOI
Domination in permutation graphs
Martin Farber,J. Mark Keil +1 more
TL;DR: O ( n 3 ) algorithms to solve the weighted domination and weighted independent domination problems in permutation graphs, and an O ( n 2 ) algorithm to solving the cardinality domination problem inpermutation graphs are presented.