219 search results - page 9 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
95
Voted
COLT
2007
Springer
15 years 3 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
114
click to vote
PODC
1993
ACM
15 years 1 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
SIAMDM
2008
14 years 9 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
71
Voted
JGT
2007
14 years 9 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
81
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...