Fully Dynamic Recognition of Proper Circular-Arc Graphs

Algorithmica - United States
doi 10.1007/s00453-013-9835-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

The 2-Tuple Domination Problem on Circular-Arc Graphs

Journal of Mathematics and Informatics
2017English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Simple Linear Algorithm for the Connected Domination Problem in Circular-Arc Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Fully Decomposable Split Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, With Applications

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1995English

Fast Fully Dynamic Landmark-Based Estimation of Shortest Path Distances in Very Large Graphs

2011English

On Criterion of Arc-Transitive Cayley Graphs

Pure Mathematics
2017English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy