On the public citation graph
Fast Parallel Algorithms for Chordal Graphs
0 signed · 52 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.1007/3-540-16042-6_28openalex-snapshot
NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90107-4openalex-snapshot
The maximum k-colorable subgraph problem for chordal graphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90140-2openalex-snapshot
Chordal graph recognition is in NC
inferredcites →https://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal 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(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/s0097539789166880openalex-snapshot
Efficient Parallel Algorithms for Chordal Graphs
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1515/crll.1869.70.185openalex-snapshot
Sur les assemblages de lignes.
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0820openalex-snapshot
Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1064openalex-snapshot
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_46openalex-snapshot
Improved Distance Oracles for Avoiding Link-Failure
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_8openalex-snapshot
A Width Parameter Useful for Chordal and Co-comparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_4openalex-snapshot
Basic Parallel Algorithms in Graph Theory
inferred← citeshttps://doi.org/10.1007/s40819-016-0216-1openalex-snapshot
Scheduling Algorithm to Select Optimal Programme Slots in Television Channels: A Graph Theoretic Approach
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90145-7openalex-snapshot
The parallel solution of domination problems on chordal and strongly chordal graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.05.001openalex-snapshot
Induced matchings in intersection graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2007.01.015openalex-snapshot
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.04.002openalex-snapshot
Parallel recognition algorithms for chordal_planar graphs and planar k -trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80122-2openalex-snapshot
Induced Matchings in Intersection Graphs
inferred← citeshttps://doi.org/10.1051/ita/2010016openalex-snapshot
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search
inferred← citeshttps://doi.org/10.1080/00207160212707openalex-snapshot
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
inferred← citeshttps://doi.org/10.1080/00207169808804664openalex-snapshot
A parallel algorithm to generate all maximal independent sets on permutation graphs
inferred← citeshttps://doi.org/10.1080/00207169908804777openalex-snapshot
An efficient algorithm to generate all maximal independent sets on trapezoid graphs
inferred← citeshttps://doi.org/10.1080/02522667.1996.10699304openalex-snapshot
Distributed algorithms for maximum cliques
inferred← citeshttps://doi.org/10.1080/10637199608915542openalex-snapshot
SCHEDULING INTERVAL ORDERS IN PARALLEL
inferred← citeshttps://doi.org/10.1109/hicss.1995.375481openalex-snapshot
Scheduling interval orders in parallel
inferred← citeshttps://doi.org/10.1109/iecon.1992.254401openalex-snapshot
200-vertex on-chip clique-finding VLSI processor for real-time 3-D object recognition
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743521openalex-snapshot
The complexity of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1137/0913067openalex-snapshot
Highly Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s0097539789166880openalex-snapshot
Efficient Parallel Algorithms for Chordal Graphs
inferred← citeshttps://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1609/aaai.v36i11.21667openalex-snapshot
Sampling and Counting Acyclic Orientations in Chordal Graphs (Student Abstract)
inferred← citeshttps://doi.org/10.3929/ethz-a-010361860openalex-snapshot
On Optimal Algorithms for List Ranking in the Parallel External Memory Model with Applications to Treewidth and other Elementary Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2199openalex-snapshot
Scheduling algorithm to select $k$ optimal programme slots in television channels: A graph theoretic approach
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.