3471 search results - page 233 / 695 » Obstacle Numbers of Graphs |
141
click to vote
JCT
2007
15 years 5 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
133
click to vote
TSMC
2008
15 years 5 months ago
2008
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
136
click to vote
STACS
2010
Springer
16 years 2 days ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
138
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
129
click to vote
FORMATS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...