Robust algorithms for restricted domains

MaRDI QIDQ2768334zbMATH OpenFDO

Authors Vijay Raghavan, Jeremy P. Spinrad

Publication date 30 January 2002

zbMATH Keywords

efficient algorithms for restricted domains

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Robust algorithms for restricted domains
• Robustly solvable constraint satisfaction problems
• Robust satisfiability of constraint satisfaction problems
• Robust satisfiability for CSPs: hardness and algorithmic results
• Solving problems on special classes of graphs

Cited in

(13)

• Robust algorithms: a different approach to oracles
• Co-bipartite neighborhood edge elimination orderings
• A simple linear time algorithm for cograph recognition
• On-line coloring of geometric intersection graphs
• Independent sets in Line of Sight networks
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs
• Full characterization of a class of graphs tailored for software watermarking
• Robust algorithms for restricted domains
• Bisectored unit disk graphs
• Shifting strategy for geometric graphs without geometry
• Random channel assignment in the plane
• Computing a maximum clique in geometric superclasses of disk graphs
• On distance constrained labeling of disk graphs

This page was built for publication: Robust algorithms for restricted domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768334)