The following pages link to Algorithms and Computation (Q5712173):
Displayed 34 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Secure total domination in chain graphs and cographs (Q4956172) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- (Q5061786) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor (Q5862812) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Tropical paths in vertex-colored graphs (Q5918388) (← links)
- Transversals of longest paths (Q5919333) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- Algorithmic aspects of certified domination in graphs (Q6101494) (← links)
- (Q6155858) (← links)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956) (← links)
- Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)