On the approximation hardness of geodetic set and its variants (Q2695276): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3198211754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge geodetic number of product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Edge Geodetic Number Of A Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6065396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation for the geodetic set problem in some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic cores and Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic number of complete bipartite graphs and of graphs with specified diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic problem on complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic problem in grid-like architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge geodetic problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge geodetic number and Cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comment on "Edge Geodetic Covers in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On residual approximation in solution extension problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge geodetic problem on grids / rank
 
Normal rank

Latest revision as of 19:44, 31 July 2024

scientific article
Language Label Description Also known as
English
On the approximation hardness of geodetic set and its variants
scientific article

    Statements

    On the approximation hardness of geodetic set and its variants (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references

    Identifiers