199 search results - page 8 / 40 » Recognizing HHDS-Free Graphs |
WWW
2009
ACM
14 years 10 months ago
2009
ACM
Community Question Answering (CQA) has emerged as a popular forum for users to pose questions for other users to answer. Over the last few years, CQA portals such as Naver and Yah...
JGAA
2006
13 years 9 months ago
2006
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
WG
2001
Springer
14 years 2 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
MVA
1996
13 years 11 months ago
1996
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...