Some optimization problems on weak-bisplit graphs

DOI10.1016/j.ipl.2003.09.015zbMath1172.90498OpenAlexW4300076679MaRDI QIDQ1029034

Jean-Marie Vanherpe

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.09.015

zbMATH Keywords

combinatorial problemsgraph algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the all-pairs-shortest-length problem on chordal bipartite graphs
• Solving the shortest-paths problem on bipartite permutation graphs efficiently
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• Complement reducible graphs
• Graph Classes: A Survey
• BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
• LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS

This page was built for publication: Some optimization problems on weak-bisplit graphs