6740 search results - page 329 / 1348 » An s -Hamiltonian Line Graph Problem |
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
142
click to vote
CIDM
2009
IEEE
15 years 8 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
131
click to vote
FOSSACS
2006
Springer
15 years 8 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
100
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
117
click to vote
DM
1998
15 years 3 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...