Titlebook: ;

撕裂皮肉

Ancillary

Fracture

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs,t in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). Furthermore, we show that Ω(1.3247.) is a lower bound on the worst-case running time of this algorithm.

臭名昭著

An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time,parability graph using .(.) integers so that, given two vertices, it can be determined in .(1) time whether they are adjacent, no matter how dense the graph is. We give a linear-time algorithm for finding the four linear orders, improving on their bound of .(. .).

诱导

https://doi.org/10.1007/978-1-4615-1203-5t in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). Furthermore, we show that Ω(1.3247.) is a lower bound on the worst-case running time of this algorithm.

老人病学

aquatic

Callus

Generalised Dualities and Finite Maximal Antichains,existence of homomorphism. We show that these antichains correspond exactly to the generalised dualities. This solves a problem posed in [1]. Finally, we show that it is NP-hard to decide whether a finite set of digraphs forms a maximal antichain.

粘连

Torrid

Generalised Dualities and Finite Maximal Antichains,termined by a finite number of forbidden subgraphs. We prove that these situations, called ., are characterised by the non-existence of a homomorphism to . from a finite set of forests..Furthermore, we characterise all finite maximal antichains in the partial order of directed graphs ordered by the