On the public citation graph

Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings

0 signed · 47 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11604686_18openalex-snapshot
Ultimate Generalizations of LexBFS and LEX M
inferredcites →https://doi.org/10.1007/3-540-59071-4_39openalex-snapshot
On domination elimination orderings and domination graphs
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_1openalex-snapshot
Lexicographic Breadth First Search – A Survey
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/s00453-004-1084-3openalex-snapshot
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0022-247x(76)90182-7openalex-snapshot
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
inferredcites →https://doi.org/10.1016/0166-218x(84)90008-8openalex-snapshot
Some aspects of perfect elimination orderings in chordal graphs
inferredcites →https://doi.org/10.1016/j.dam.2007.02.004openalex-snapshot
On the maximum cardinality search lower bound for treewidth
inferredcites →https://doi.org/10.1016/j.disc.2005.12.005openalex-snapshot
Lex M versus MCS-M
inferredcites →https://doi.org/10.1016/s0166-218x(98)00005-5openalex-snapshot
Separability generalizes Dirac's theorem
inferredcites →https://doi.org/10.1016/s0304-3975(99)00126-7openalex-snapshot
A practical algorithm for making filled graphs minimal
inferredcites →https://doi.org/10.1016/s1571-0653(05)80065-4openalex-snapshot
Moplex elimination orderings
inferredcites →https://doi.org/10.1137/0205012openalex-snapshot
A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a 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/050623498openalex-snapshot
A Unified View of Graph Searching
inferredcites →https://doi.org/10.1137/s0097539795282377openalex-snapshot
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and 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.1007/978-3-030-83823-2_55openalex-snapshot
Graphs Where Search Methods Are Indistinguishable
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_8openalex-snapshot
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications
inferred← citeshttps://doi.org/10.1007/s10878-018-0270-1openalex-snapshot
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.011openalex-snapshot
A General Label Search to investigate classical graph search algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.030openalex-snapshot
Organizing the atoms of the clique separator decomposition into an atom tree
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.016openalex-snapshot
Semi-proper interval graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.010openalex-snapshot
Recognizing Graph Search Trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.02.013openalex-snapshot
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
inferred← citeshttps://doi.org/10.1016/j.neuroimage.2011.01.044openalex-snapshot
Comparing the similarity and spatial structure of neural representations: A pattern-component model
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.030openalex-snapshot
Bayesian networks: The minimal triangulations of a graph
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0openalex-snapshot
Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC)
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.10openalex-snapshot
Transformer-based Sarcasm Detection in English and Slovene Language
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.11openalex-snapshot
Extraction and Analysis of Sport Activity Data Inside Certain Area
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.13openalex-snapshot
Embedding Non-planar Graphs: Storage and Representation
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.14openalex-snapshot
Analiza ritmičnosti števnih podatkov z uporabo modela cosinor
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.15openalex-snapshot
Analiza sentimenta komentarjev hotelov z uporabo slovarjev in metode Naivni Bayes
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.16openalex-snapshot
Časovni razporejevalniki in brezstrežniško okolje
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.2openalex-snapshot
Zero-Knowledge Authentication
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.3openalex-snapshot
Graphs where Search Methods are Indistinguishable
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.6openalex-snapshot
Adversarial Image Perturbation with a Genetic Algorithm
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.8openalex-snapshot
Interactive Evolutionary Computation Approach to Permutation Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.9openalex-snapshot
Towards Representative Web Performance Measurements with Google Lighthouse
inferred← citeshttps://doi.org/10.23638/dmtcs-21-1-13openalex-snapshot
On the End-Vertex Problem of Graph Searches
inferred← citeshttps://doi.org/10.3390/a10010020openalex-snapshot
Computing a Clique Tree with the Algorithm Maximal Label Search
inferred← citeshttps://doi.org/10.3390/a3020100openalex-snapshot
Graph Extremities Defined by Search Algorithms
inferred← citeshttps://doi.org/10.3390/a3020197openalex-snapshot
An Introduction to Clique Minimal Separator Decomposition
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.13openalex-snapshot
Linear Time LexDFS on Chordal Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09623openalex-snapshot
Computing a clique tree with algorithm MLS (Maximal Label Search)
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.