1729 search results - page 52 / 346 » On Bounds for the k-Partitioning of Graphs |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
GLVLSI
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
ECCC
2008
14 years 10 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...