Hoang-Oanh Le

Independent

Learn more about SSRN Profiles

SCHOLARLY PAPERS

1

DOWNLOADS

36

TOTAL CITATIONS

2

Feedback

Scholarly Papers (1)

Sort by:

Actions:

View:
Selected
Original List
All Versions Hide All Versions
All Abstracts Hide All Abstracts

(Rank)

1.

Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles 1

Number of pages: 28 Posted: 10 Apr 2024

Van Bang Le and Hoang-Oanh Le

University of Rostock and Independent

Downloads 36 (1,249,711)

Citation 2

Abstract:

Feedback

All content on this site: Copyright © 2026 Elsevier Inc., its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply.

We use cookies to help provide and enhance our service and tailor content.

To learn more, visit .