6413 search results - page 24 / 1283 » Classes of cycle bases |
106
click to vote
JCP
2008
15 years 12 days ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
DAGSTUHL
2007
15 years 1 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
118
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
113
click to vote
ISR
2006
15 years 12 days ago
2006
Prior research suggests that supply chain collaboration has enabled companies to compete more efficiently in a global economy. We investigate a class of collaboration software for...
101
click to vote
WG
2009
Springer
15 years 7 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...