Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-15369-3_20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs

2018English

Computer Vision Algorithms for Intersection Monitoring

IEEE Transactions on Intelligent Transportation Systems
Automotive EngineeringComputer Science ApplicationsMechanical Engineering
2003English

Grid Intersection and Box Intersection Graphs on Surfaces

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms

2020English

Triangle-Free Planar Graphs as Segments Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Approximation Algorithms for Geometric Networks

English

Intersection Graphs of Jordan Arcs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy