9532 search results - page 380 / 1907 » Logic, Graphs, and Algorithms |
203
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
241
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
162
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
169
click to vote
CSR
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
218
click to vote
INFORMS
1998
15 years 6 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...