A note on line digraphs and the directed max-cut problem

Authors:
V. Chvátal;C. Ebenegger
Affiliations:
-;-
Venue:
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Year:
1990

Citing 0
Cited 4

A characterization problem on underlying graphs of line digraphs

Discrete Applied Mathematics
On the complexity of recognizing directed path families

Discrete Applied Mathematics
Notes: A characterization problem on underlying graphs of line digraphs

Discrete Applied Mathematics
Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs

ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks

Quantified Score

Hi-index	0.00

Visualization

Abstract