Maximum weight t-sparse set problem on vector-weighted graphs
From MaRDI portal
Publication:6140983
DOI10.1051/ro/2023145MaRDI QIDQ6140983
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Co-2-plex vertex partitions
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- A generalization of Nemhauser and Trotter's local optimization theorem
- On bounded-degree vertex deletion parameterized by treewidth
- The \(t\)-stability number of a random graph
- An optimal time algorithm for finding a maximum weight independent set in a tree
- On maximal independent sets of vertices in claw-free graphs
- Some defective parameters in graphs
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- Every Property of Hyperfinite Graphs Is Testable
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Improper coloring of unit disk graphs
- Node-Deletion Problems on Bipartite Graphs
- A graph‐theoretic generalization of the clique concept
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
- Parameterized Algorithms
- 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
- The maximum number of maximum dissociation sets in trees
