scientific article

Mauricio G. C. Resende, Paola Festa, Panos M. Pardalos

Publication date: 23 December 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Combinatorial optimization (90C27)

Related Items

Augmenting approach for some maximum set problems, Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs, Circular convex bipartite graphs: feedback vertex sets, Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT, Unnamed Item, Unnamed Item, Well-partitioned chordal graphs, Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms, On the feedback number of 3-uniform linear extremal hypergraphs, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, A survey on the linear ordering problem for weighted or unweighted tournaments, New upper bounds on feedback vertex numbers in butterflies, Feedback numbers of Kautz digraphs, The \(k\)-strong induced arboricity of a graph, Almost always observable hybrid systems, Deterministic Algorithms for the Independent Feedback Vertex Set Problem, Feedback vertex set on Hamiltonian graphs, 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, On the complexity of feedback set problems in signed digraphs, A Linear Kernel for Planar Feedback Vertex Set, New bounds on the decycling number of generalized de Bruijn digraphs, Target set selection on generalized pancake graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem, Cycle reversions and dichromatic number in tournaments, Edge-disjoint odd cycles in planar graphs., On approximability of linear ordering and related NP-optimization problems on graphs., On the decycling number of generalized Kautz digraphs, A spin glass approach to the directed feedback vertex set problem, Generalizedk-core pruning process on directed networks, Two Hardness Results on Feedback Vertex Sets, Analysis, calculation and utilization of the \(k\)-balance attribute in interdependent networks, Acyclic polynomials of graphs, The critical node detection problem in networks: a survey, Improved FPT Algorithms for Deletion to Forest-Like Structures., Improved algorithms for feedback vertex set problems, On the minimum feedback vertex set problem: Exact and enumeration algorithms, On parameterized independent feedback vertex set, FPT algorithms for connected feedback vertex set, Approximability of the independent feedback vertex set problem for bipartite graphs, A cubic kernel for feedback vertex set and loop cutset, Half-integral packing of odd cycles through prescribed vertices, Soft arc consistency revisited, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms, A constraint programming approach to cutset problems, Fixed-parameter tractability results for feedback set problems in tournaments, Feedback numbers of de Bruijn digraphs, 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, Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs, Multistage methods for freight train classification, Minimum feedback vertex sets in shuffle-based interconnection networks, Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs, Modeling the pancreatic cancer microenvironment in search of control targets, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Minimum feedback vertex set and acyclic coloring., Unnamed Item, Fixed-parameter tractability for subset feedback set problems with parity constraints, An Improved Exact Algorithm for Undirected Feedback Vertex Set, Circular Convex Bipartite Graphs: Feedback Vertex Set, An improved exact algorithm for undirected feedback vertex set