On the public citation graph
Efficient parallel recognition of some circular arc graphs, II
0 signed · 69 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230230105openalex-snapshot
Efficient parallel algorithms for bipartite permutation graphs
inferredcites →https://doi.org/10.1007/3-540-51542-9_25openalex-snapshot
NC algorithms for circular-arc graphs
inferredcites →https://doi.org/10.1007/3-540-56279-6_98openalex-snapshot
A simple test for the consecutive ones property
inferredcites →https://doi.org/10.1007/3-540-58325-4_223openalex-snapshot
Revisiting circular arc graphs
inferredcites →https://doi.org/10.1007/bf01190897openalex-snapshot
Efficient parallel recognition of some circular arc graphs, I
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0012-365x(76)90095-9openalex-snapshot
On the complexity of posets
inferredcites →https://doi.org/10.1016/0020-0190(83)90078-9openalex-snapshot
Finding Hamiltonian circuits in proper interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(84)90033-4openalex-snapshot
On a circle-cover minimization problem
inferredcites →https://doi.org/10.1016/0020-0190(87)90007-xopenalex-snapshot
Finding maximum cliques on circular-arc graphs
inferredcites →https://doi.org/10.1016/0020-0190(89)90031-8openalex-snapshot
A parallel circle-cover minimization algorithm
inferredcites →https://doi.org/10.1016/0020-0190(89)90037-9openalex-snapshot
An optimal parallel algorithm for the minimum circle-cover problem
inferredcites →https://doi.org/10.1016/0020-0190(89)90060-4openalex-snapshot
An optimal parallel circle-cover algorithm
inferredcites →https://doi.org/10.1016/0020-0190(89)90220-2openalex-snapshot
An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs
inferredcites →https://doi.org/10.1016/0020-0190(91)90165-eopenalex-snapshot
Linear time algorithms on circular-arc graphs
inferredcites →https://doi.org/10.1016/0020-0190(92)90239-ropenalex-snapshot
Optimal parallel time bounds for the maximum clique problem on intervals
inferredcites →https://doi.org/10.1016/0041-1647(68)90016-6openalex-snapshot
Scheduling of traffic lights—A new approach
inferredcites →https://doi.org/10.1016/0166-218x(85)90025-3openalex-snapshot
Dominating sets and domatic number of circular arc graphs
inferredcites →https://doi.org/10.1016/0166-218x(87)90068-0openalex-snapshot
Some parallel algorithms on interval graphs
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc graphs
inferredcites →https://doi.org/10.1016/0196-6774(91)90010-vopenalex-snapshot
Parallel recognition of the consecutive ones property with applications
inferredcites →https://doi.org/10.1016/0890-5401(87)90061-7openalex-snapshot
Parallel recognition and decomposition of two terminal series parallel graphs
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferredcites →https://doi.org/10.1016/s0012-365x(74)80027-0openalex-snapshot
Structure theorems for some circular-arc graphs
inferredcites →https://doi.org/10.1016/s0012-365x(76)80011-8openalex-snapshot
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0166-218x(87)80003-3openalex-snapshot
Bipartite permutation graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1073/pnas.45.11.1607openalex-snapshot
ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE
inferredcites →https://doi.org/10.1109/icci.1993.315408openalex-snapshot
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
inferredcites →https://doi.org/10.1109/ipps.1994.288297openalex-snapshot
Solving the all-pair shortest path problem on interval and circular-arc graphs
inferredcites →https://doi.org/10.1109/iscas.1989.100514openalex-snapshot
Efficient parallel algorithms for several intersection graphs
inferredcites →https://doi.org/10.1111/j.2044-8317.1974.tb00534.xopenalex-snapshot
SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/0214018openalex-snapshot
Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
inferredcites →https://doi.org/10.1137/0217003openalex-snapshot
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
inferredcites →https://doi.org/10.1137/0221061openalex-snapshot
An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/0602012openalex-snapshot
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
inferredcites →https://doi.org/10.1145/322123.322125openalex-snapshot
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
inferredcites →https://doi.org/10.1145/800222.806745openalex-snapshot
Relations between concurrent-write models of parallel computation
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.2140/pjm.1971.39.535openalex-snapshot
Matrix characterizations of circular-arc graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22486openalex-snapshot
Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
inferred← citeshttps://doi.org/10.1006/jcss.1998.1572openalex-snapshot
Optimal Circular Arc Representations: Properties, Recognition, and Construction
inferred← citeshttps://doi.org/10.1006/jcss.1999.1642openalex-snapshot
Graph Isomorphism and Identification Matrices: Sequential Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_223openalex-snapshot
Revisiting circular arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_2openalex-snapshot
Tight lower bounds for computing shortest paths on proper interval and bipartite permutation graphs
inferred← citeshttps://doi.org/10.1007/bfb0020470openalex-snapshot
Optimal circular arc representations
inferred← citeshttps://doi.org/10.1007/bfb0045089openalex-snapshot
A selected tour of the theory of identification matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2006.07.005openalex-snapshot
Recognizing and representing proper interval graphs in parallel using merging and sorting
inferred← citeshttps://doi.org/10.1016/j.disc.2011.12.029openalex-snapshot
On the recognition of fuzzy circular interval graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2016.03.001openalex-snapshot
Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00236-4openalex-snapshot
A selected tour of the theory of identification matrices
inferred← citeshttps://doi.org/10.1080/01495739908947372openalex-snapshot
ON THE POWER OF SOME PRAM MODELS
inferred← citeshttps://doi.org/10.1109/71.491584openalex-snapshot
Graph isomorphism and identification matrices: parallel algorithms
inferred← citeshttps://doi.org/10.1109/ispan.1994.367158openalex-snapshot
Parallel graph isomorphism detection with identification matrices
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.387openalex-snapshot
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace
inferred← citeshttps://doi.org/10.48550/arxiv.1202.4406openalex-snapshot
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.