2125 search results - page 17 / 425 » On Graph Complexity |
132
click to vote
MLG
2007
Springer
15 years 9 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
147
click to vote
ALGORITHMICA
2008
15 years 2 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
122
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
DAC
2000
ACM
16 years 3 months ago
2000
ACM
137
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...