Combinatorial algorithms on a class of graphs
From MaRDI portal
Publication:1336626
DOI10.1016/0166-218X(94)90022-1zbMath0941.68589OpenAlexW2117549465MaRDI QIDQ1336626
Publication date: 1 August 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)90022-1
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (17)
Perfect edge domination and efficient edge domination in graphs ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Evolutionary operators for the Hamiltonian completion problem ⋮ An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem ⋮ Exact counting of Euler tours for generalized series-parallel graphs ⋮ Algorithmic and complexity aspects of problems related to total restrained domination for graphs ⋮ Recognition of directed acyclic graphs by spanning tree automata ⋮ A note on integral generalized flows in directed partial 2-trees ⋮ Efficient algorithm for the vertex cover \(P_k\) problem on cacti ⋮ Cross-series-parallel digraphs ⋮ A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths ⋮ Integer programming approach to static monopolies in graphs ⋮ Counting dominating sets in generalized series-parallel graphs ⋮ Combinatorial Scoring of Phylogenetic Networks ⋮ Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks ⋮ Maximum cycle packing using SPR-trees
Cites Work
This page was built for publication: Combinatorial algorithms on a class of graphs
