Maximum weight t-sparse set problem on vector-weighted graphs
From MaRDI portal
Publication:6140983
DOI10.1051/RO/2023145MaRDI QIDQ6140983FDOQ6140983
Authors: Yuquan Lin, Wensong Lin 
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Graph algorithms (graph-theoretic aspects) (05C85) Dynamic programming (90C39) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Signed and weighted graphs (05C22)
Cites Work
- Parameterized Algorithms
- Title not available (Why is that?)
- A generalization of Nemhauser and Trotter's local optimization theorem
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- On maximal independent sets of vertices in claw-free graphs
- Node-Deletion Problems on Bipartite Graphs
- A graph‐theoretic generalization of the clique concept
- On bounded-degree vertex deletion parameterized by treewidth
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- Independent sets of maximum weight in apple-free graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Improper coloring of unit disk graphs
- Co-2-plex vertex partitions
- The \(t\)-stability number of a random graph
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Title not available (Why is that?)
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- Some defective parameters in graphs
- Every property of hyperfinite graphs is testable
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs
- The maximum number of maximum dissociation sets in trees
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
This page was built for publication: Maximum weight t-sparse set problem on vector-weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140983)
