Pages that link to "Item:Q1383368"
From MaRDI portal
The following pages link to The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368):
Displaying 37 items.
- Detour trees (Q277622) (← links)
- NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- On the complexity of the {<i>k</i>}-packing function problem (Q2968508) (← links)
- Wiener Index of Hypertree (Q3296832) (← links)
- Improved Bound for Dilation of an Embedding onto Circulant Networks (Q3296854) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Coloring squares of graphs via vertex orderings (Q5859506) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
