Algorithms and Computation
From MaRDI portal
Publication:5712173
DOI10.1007/b104582zbMath1116.05318OpenAlexW2491382297MaRDI QIDQ5712173
Publication date: 22 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104582
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (34)
An approximation algorithm for the longest cycle problem in solid grid graphs ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Linear structure of bipartite permutation graphs and the longest path problem ⋮ The Longest Path Problem Is Polynomial on Interval Graphs ⋮ Hardness results of connected power domination for bipartite graphs and chordal graphs ⋮ QUBO formulations of the longest path problem ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ The longest path problem is polynomial on cocomparability graphs ⋮ Dendrograms, minimum spanning trees and feature selection ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ The longest path problem has a polynomial solution on interval graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ Unnamed Item ⋮ Computing and counting longest paths on circular-arc graphs in polynomial time ⋮ The Maximum Binary Tree Problem. ⋮ Algorithmic aspects of certified domination in graphs ⋮ Algorithmic aspects of total Roman ${2}$-domination in graphs ⋮ Unnamed Item ⋮ Algorithmic Aspects of Quasi-Total Roman Domination in Graphs ⋮ Independent roman $\{3\}$-domination ⋮ On partial Grundy coloring of bipartite graphs and chordal graphs ⋮ The Longest Path Problem is Polynomial on Cocomparability Graphs ⋮ Tropical paths in vertex-colored graphs ⋮ Secure total domination in chain graphs and cographs ⋮ The maximum binary tree problem ⋮ Algorithmic aspects of secure connected domination in graphs ⋮ A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs ⋮ Transversals of longest paths ⋮ Algorithmic aspects of Roman domination in graphs ⋮ Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time ⋮ Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor ⋮ Algorithmic complexity of weakly connected Roman domination in graphs ⋮ Algorithmic aspects of total Roman {3}-domination in graphs
This page was built for publication: Algorithms and Computation
