Backup 2-center on interval graphs (Q442280)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Backup 2-center on interval graphs

scientific article; zbMATH DE number 6064616

Language	Label	Description	Also known as
default for all languages	No label defined
English	Backup 2-center on interval graphs	scientific article; zbMATH DE number 6064616

Statements

instance of

scholarly article

0 references

title

Backup 2-center on interval graphs (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

10 August 2012

0 references

zbMATH Keywords

backup 2-center

0 references

interval graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2012.05.003

0 references

cites work

Algorithms and Computation

0 references

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

0 references

An Overview of Representative Problems in Location Research

0 references

Efficient algorithms for centers and medians in interval and circular-arc graphs

0 references

Slowing down sorting networks to obtain faster sorting algorithms

0 references

Solving the all-pair shortest path query problem on interval and circular-arc graphs

0 references

Proper interval graphs and the guard problem

0 references

An improved algorithm for the $p$-center problem on interval graphs with unit lengths

0 references

Q4037428

0 references

Finding kth paths and p-centers by generating and searching good data structures

0 references

On some optimization problems on $k$-trees and partial $k$-trees

0 references

Q4198056

0 references

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

0 references

Parallel concepts in graph theory

0 references

Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs

0 references

Sum coloring interval and $k$-claw free graphs with application to scheduling dependent jobs

0 references

Scheduling with conflicts on bipartite and interval graphs

0 references

Algorithms for finding P-centers on a weighted tree (for relatively small P)

0 references

An Algorithmic Approach to Network Location Problems. I: Thep-Centers

0 references

A linear-time algorithm for solving the center problem on weighted cactus graphs

0 references

A fully dynamic graph algorithm for recognizing interval graphs

0 references

New Results on the Complexity of p-Centre Problems

0 references

An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems

0 references

A simple linear-time algorithm for computing the center of an interval graph

0 references

The backup 2‐center and backup 2‐median problems on trees

0 references

The obnoxious center problem on weighted cactus graphs.

0 references

Identifiers

zbMATH Open document ID

1243.68023

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.TCS.2012.05.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Backup 2-center on interval graphs