1997-04
2019-04-10T15:00
1997-04-01
en
http://link.springer.com/10.1007%2FBF02523681
AnO(n3) recognition algorithm for bithreshold graphs
false
https://scigraph.springernature.com/explorer/license/
A bithreshold graph is the edge intersection of two threshold graphs such that every independent set is independent in at least one of the threshold components. Recognizing a bithreshold graph is polynomially equivalent to recognizing its complement, i.e., a cobithreshold graph. In this paper we introduce a coloring of the vertices and of the edges of a cobithreshold graph that leads to a recognition and decomposition algorithm. This algorithm works inO(n3) time improving the previously knownO(n4) result [HM].
articles
research_article
416-425
Computation Theory and Mathematics
4
Department of Computer Science, University “La Sapienza”, Via Salaria 113, 00198, Rome, Italy
Sapienza University of Rome
R.
Petreschi
dimensions_id
pub.1051110606
10.1007/bf02523681
doi
A.
Sterbini
Algorithmica
0178-4617
1432-0541
Springer Nature - SN SciGraph project
De Agostino
S.
f378bd2be94360a3bacf280d79dfdca2bebe37851b090f86ae1551a28e4df7b1
readcube_id
Information and Computing Sciences
17