3204 search results - page 183 / 641 » The b-chromatic Number of a Graph |
WG
2009
Springer
14 years 5 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...
FORMATS
2004
Springer
14 years 3 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...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
EPEW
2008
Springer
14 years 4 days ago
2008
Springer
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
CATS
2008
13 years 12 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...