2294 search results - page 124 / 459 » From Path Graphs to Directed Path Graphs |
105
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
123
click to vote
MCU
2004
15 years 4 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
125
click to vote
CONSTRAINTS
2008
15 years 2 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
139
Voted
DMTCS
2010
15 years 7 days ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
169
click to vote
ICALP
2009
Springer
16 years 3 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...