Zobrazeno 1 - 10
of 1 316
pro vyhledávání: '"Carlson, Charles"'
Autor:
Maher, Philip
Publikováno v:
The Mathematical Gazette, 1998 Jul 01. 82(494), 339-341.
Externí odkaz:
https://www.jstor.org/stable/3620451
Publikováno v:
In Journal of Hand Surgery August 2024 49(8):752-756
Autor:
Frederiksen, Eric H., Ramirez, Marcia V. Rojas, Moreno-Hay, Isabel, Miller, Craig S., Carlson, Charles R.
Publikováno v:
In Oral Surgery, Oral Medicine, Oral Pathology and Oral Radiology June 2024 137(6):594-603
Autor:
Knüppel, Michael
Publikováno v:
Central Asiatic Journal, 2010 Jan 01. 54(1), 108-115.
Externí odkaz:
https://www.jstor.org/stable/41928542
An emerging trend in approximate counting is to show that certain `low-temperature' problems are easy on typical instances, despite worst-case hardness results. For the class of regular graphs one usually shows that expansion can be exploited algorit
Externí odkaz:
http://arxiv.org/abs/2003.01154
For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history and was extensively studied in the last fifty years. In this paper we
Externí odkaz:
http://arxiv.org/abs/1810.10044
Autor:
Lambert, Emily
Publikováno v:
Forbes. 2/16/2009, Vol. 183 Issue 3, p56-58. 2p.
Finding locally optimal solutions for max-cut and max-$k$-cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instan
Externí odkaz:
http://arxiv.org/abs/1807.05665