scientific article; zbMATH DE number 2079869

MaRDI QIDQ4471994zbMATH OpenFDO

Authors Marc Demange, Xavier Paradon, Vangelis Th. Paschos

Publication date 3 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1963/19630327.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On-line maximum-order induced hereditary subgraph problems
• Algorithms and Computation
• Reducing off-line to on-line: An example and its applications
• On-line computation and maximum-weighted hereditary subgraph problems
• Advice complexity of the online induced subgraph problem

Cited in

(13)

• On-line vertex-covering
• Advice complexity of maximum independent set in sparse and bipartite graphs
• On-line computation and maximum-weighted hereditary subgraph problems
• A survey on combinatorial optimization in dynamic environments
• Competitive strategies for online clique clustering
• On-line models and algorithms for max independent set
• Reoptimization of maximum weight induced hereditary subgraph problems
• Advice complexity of the online induced subgraph problem
• On-line maximum-order induced hereditary subgraph problems
• Reducing off-line to on-line: An example and its applications
• Competitive online clique clustering
• Algorithms and Computation
• The string guessing problem as a method to prove lower bounds on the advice complexity

This page was built for publication:

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