Efficiency in exponential time for domination-type problems (Q1003475): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.05.035 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993301031 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4711895 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4944990 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spanning trees with many leaves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of colouring problems on dense graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4778579 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768314 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4417671 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the complexity of the chromatic number problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination in graphs with minimum degree two / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On cliques in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4108373 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Stars and the Number Three / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for maximum independent sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4882469 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5509541 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414647 / rank | |||
Normal rank |
Latest revision as of 03:31, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficiency in exponential time for domination-type problems |
scientific article |
Statements
Efficiency in exponential time for domination-type problems (English)
0 references
4 March 2009
0 references
exact algorithms
0 references
domination
0 references
matching technique
0 references