1729 search results - page 24 / 346 » Bound Graph Polysemy |
133
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
153
click to vote
CORR
2012
Springer
14 years 5 days 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...
155
click to vote
GLVLSI
2000
IEEE
15 years 9 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...
130
click to vote
LATIN
2004
Springer
15 years 9 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 ...
122
click to vote
IWOCA
2009
Springer
15 years 11 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...