Search
w/in this Title
for Titles
All Reviews
Combinatorica
Elsevier North-Holland, Inc.
Options:
Date Reviewed
Title
Author
Publisher
Published Date
Descending Order
Ascending Order
1-5 of 5 reviews
Date Reviewed
Profiles of separations: in graphs, matroids, and beyond
Diestel R., Hundertmark F., Lemanczyk S. Combinatorica 39(1): 37-75, 2019. Type: Article
A matroid is a structure of finite nonempty sets of subsets that apply the hereditary property. Here, the authors deploy tree decomposition to distinguish the tangles of a finite graph or matroid. They also apply the Gomory-Hu theorem ...
Feb 23 2021
On the density of triangles and squares in regular finite and unimodular random graphs
Harangi V. Combinatorica 33(5): 531-548, 2013. Type: Article
Graphs are the subject of many questions in combinatorics. For example, the following question by Erdös was settled only recently: How many 5-cycles can there be in a graph without 3-cycles? This paper addresses a similar prob...
Apr 11 2014
Recognizing Berge graphs
Chudnovsky M., Cornuéjols G., Liu X., Seymour P., Vušković K. Combinatorica 25(2): 143-186, 2005. Type: Article
In this paper, Chudnovsky et al. rigorously present an algorithm for determining whether a given graph is Berge, which is equivalent to testing if the graph is perfect. The importance of the proposed algorithm is that its running time ...
Sep 19 2006
Sorting in
c
log
n
parallel steps
Ajtai M., Komlós J., Szemerédi E. Combinatorica 3(1): 1-19, 1983. Type: Article
Early research into sorting focused on
in situ
comparison-based sorting algorithms. Such an algorithm is said to be
oblivious
(a term which can be traced, in a different context, to Paterson) if the sequence of cells acce...
Nov 1 1989
A new polynomial-time algorithm for linear programming
Karmarkar N. Combinatorica 4(4): 373-395, 1984. Type: Article
This paper describes a remarkable new polynomial algorithm for linear programming which has already elicited considerable publicity in the popular press, as well as among the operations research and computer science research communitie...
Feb 1 1986
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy