On the public citation graph
Minimizing NLC-Width is NP-Complete
0 signed · 39 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.1006/jagm.1995.1009openalex-snapshot
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
inferredcites →https://doi.org/10.1007/0-387-22444-0_4openalex-snapshot
Algorithmic Aspects of Tree Width
inferredcites →https://doi.org/10.1007/10719839_14openalex-snapshot
Polynomial Time Recognition of Clique-Width ≤ 3 Graphs
inferredcites →https://doi.org/10.1007/3-540-45477-2_12openalex-snapshot
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_16openalex-snapshot
Vertex Disjoint Paths on Clique-Width Bounded Graphs
inferredcites →https://doi.org/10.1007/b95852openalex-snapshot
LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
inferredcites →https://doi.org/10.1007/s002249910009openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0166-218x(94)90026-4openalex-snapshot
k-NLC graphs and polynomial algorithms
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/j.tcs.2005.05.018openalex-snapshot
On the relationship between NLC-width and linear NLC-width
inferredcites →https://doi.org/10.1016/s0166-218x(02)00198-1openalex-snapshot
Edge dominating set and colorings on graphs with fixed clique-width
inferredcites →https://doi.org/10.1016/s0166-218x(99)00184-5openalex-snapshot
Upper bounds to the clique width of graphs
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1142/s0129054100000223openalex-snapshot
NLC 2-DECOMPOSITION IN POLYNOMIAL TIME
inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferredcites →https://doi.org/10.1145/321850.321853openalex-snapshot
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of 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-540-74839-7_9openalex-snapshot
NLC-2 Graph Recognition and Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_3openalex-snapshot
Algorithmic Meta-theorems
inferred← citeshttps://doi.org/10.1007/s11083-010-9174-0openalex-snapshot
Well-Quasi-Order of Relabel Functions
inferred← citeshttps://doi.org/10.1016/j.dam.2009.06.024openalex-snapshot
On a disparity between relative cliquewidth and relative NLC-width
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.014openalex-snapshot
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.048openalex-snapshot
Linear layouts measuring neighbourhoods in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.004openalex-snapshot
A local characterization of bounded clique-width for line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.01.020openalex-snapshot
Line graphs of bounded clique-width
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.026openalex-snapshot
Vertex disjoint paths on clique-width bounded graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.010openalex-snapshot
Characterizations for restricted graphs of NLC-width 2
inferred← citeshttps://doi.org/10.1017/cbo9780511974960.006openalex-snapshot
Algorithmic meta-theorems
inferred← citeshttps://doi.org/10.1145/1132516.1132568openalex-snapshot
Clique-width minimization is NP-hard
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28916openalex-snapshot
Learning Small Decision Trees for Data of Low Rank-Width
inferred← citeshttps://doi.org/10.24963/ijcai.2023/369openalex-snapshot
The Parameterized Complexity of Finding Concise Local Explanations
inferred← citeshttps://doi.org/10.48550/arxiv.0806.4073openalex-snapshot
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot
Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.
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.