Sciweavers

684 search results - page 5 / 137
» A characterization of b-perfect graphs
Sort
View
APPML
2008
93views more  APPML 2008»
13 years 11 months ago
A matrix characterization of interval and proper interval graphs
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimiz...
George B. Mertzios
FOCS
2005
IEEE
14 years 4 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
EJC
2010
13 years 11 months ago
Combinatorial characterization of the Assur graphs from engineering
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
Brigitte Servatius, Offer Shai, Walter Whiteley
JCT
2008
81views more  JCT 2008»
13 years 11 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
14 years 11 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...