scientific article; zbMATH DE number 6118220
From MaRDI portal
Publication:3145802
zbMATH Open1253.90193MaRDI QIDQ3145802FDOQ3145802
Mauricio G. C. Resende, Paola Festa, Panos M. Pardalos
Publication date: 23 December 2012
Title of this publication is not available (Why is that?)
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)
Cited In (66)
- Generalizedk-core pruning process on directed networks
- Phenotype control techniques for Boolean gene regulatory networks
- MIP formulations for induced graph optimization problems: a tutorial
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
- Title not available (Why is that?)
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- The decycling number of a line graph
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- A spin glass approach to the directed feedback vertex set problem
- Approximability of the independent feedback vertex set problem for bipartite graphs
- A Linear Kernel for Planar Feedback Vertex Set
- Analysis, calculation and utilization of the \(k\)-balance attribute in interdependent networks
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- A constraint programming approach to cutset problems
- Minimum feedback vertex sets in shuffle-based interconnection networks
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- On parameterized independent feedback vertex set
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Augmenting approach for some maximum set problems
- Improved algorithms for feedback vertex set problems
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- New upper bounds on feedback vertex numbers in butterflies
- On approximability of linear ordering and related NP-optimization problems on graphs.
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Title not available (Why is that?)
- Circular convex bipartite graphs: feedback vertex sets
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- FPT algorithms for connected feedback vertex set
- Well-partitioned chordal graphs
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Mim-width. II. The feedback vertex set problem
- On the feedback number of 3-uniform linear extremal hypergraphs
- Circular Convex Bipartite Graphs: Feedback Vertex Set
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem
- On the complexity of feedback set problems in signed digraphs
- Multistage methods for freight train classification
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- A cubic kernel for feedback vertex set and loop cutset
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- An improved exact algorithm for undirected feedback vertex set
- Modeling the pancreatic cancer microenvironment in search of control targets
- The \(k\)-strong induced arboricity of a graph
- New bounds on the decycling number of generalized de Bruijn digraphs
- Title not available (Why is that?)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set
- On the decycling number of generalized Kautz digraphs
- Minimum feedback vertex set and acyclic coloring.
- Acyclic polynomials of graphs
- Feedback vertex set on Hamiltonian graphs
- Feedback numbers of Kautz digraphs
- Soft arc consistency revisited
- Almost always observable hybrid systems
- Feedback numbers of de Bruijn digraphs
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
- Half-integral packing of odd cycles through prescribed vertices
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- The critical node detection problem in networks: a survey
- Target set selection on generalized pancake graphs
- Two Hardness Results on Feedback Vertex Sets
- Fixed-parameter tractability results for feedback set problems in tournaments
- Cycle reversions and dichromatic number in tournaments
- Edge-disjoint odd cycles in planar graphs.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145802)
