Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity

doi 10.1137/1.9781611975482.64
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

English

Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications

SIAM Journal on Computing
MathematicsComputer Science
2005English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs

2002English

On Some Differential Inequalities in the Unit Disk With Applications

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2014English

Some Applications of Mittag-Leffler Function in the Unit Disk

Filomat
Mathematics
2016English

Algorithmic Complexity in Cosmology and Quantum Gravity

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2002English

Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy