On the public citation graph

Partitioning Based Algorithms for Some Colouring Problems

https://doi.org/10.1007/11754602_4
0 signed · 29 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.1002/jgt.20041openalex-snapshot
On the number of maximal bipartite subgraphs of a graph
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_101openalex-snapshot
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_6openalex-snapshot
Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1016/0020-0190(76)90065-xopenalex-snapshot
A note on the complexity of the chromatic number problem
inferredcites →https://doi.org/10.1016/0096-0551(81)90048-5openalex-snapshot
Register allocation via coloring
inferredcites →https://doi.org/10.1016/j.orl.2004.03.002openalex-snapshot
Enumerating maximal independent sets with applications to graph colouring
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.037openalex-snapshot
Counting models for 2SAT and 3SAT formulae
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferredcites →https://doi.org/10.1016/s0196-6774(02)00224-9openalex-snapshot
Worst-case time bounds for coloring and satisfiability problems
inferredcites →https://doi.org/10.1016/s0304-3975(98)00017-6openalex-snapshot
New methods for 3-SAT decision and worst-case analysis
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1109/t-vt.1986.24063openalex-snapshot
Some lower bounds for a class of frequency assignment problems
inferredcites →https://doi.org/10.1137/0206038openalex-snapshot
Finding a Maximum Independent Set
inferredcites →https://doi.org/10.48550/arxiv.cs/0009006openalex-snapshot
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction
inferredcites →https://doi.org/10.7155/jgaa.00064openalex-snapshot
Small Maximal Independent Sets and Faster Exact Graph Coloring

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11786986_48openalex-snapshot
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_31openalex-snapshot
Faster Graph Coloring in Polynomial Space
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_25openalex-snapshot
Exact Algorithm for the Maximum Induced Planar Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_3openalex-snapshot
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/s00453-007-9149-8openalex-snapshot
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
inferred← citeshttps://doi.org/10.1007/s10732-009-9116-4openalex-snapshot
A comparison of problem decomposition techniques for the FAP
inferred← citeshttps://doi.org/10.1016/j.cor.2019.05.010openalex-snapshot
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
inferred← citeshttps://doi.org/10.1109/focs.2006.41openalex-snapshot
Inclusion--Exclusion Algorithms for Counting Set Partitions
inferred← citeshttps://doi.org/10.1137/070683933openalex-snapshot
Set Partitioning via Inclusion-Exclusion
inferred← citeshttps://doi.org/10.14288/1.0051829openalex-snapshot
Aggregation and constraint processing in lifted probabilistic inference
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.