684 search results - page 44 / 137 » A characterization of b-perfect graphs |
109
click to vote
DLT
2008
15 years 3 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
NETWORKS
2006
15 years 1 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
115
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
129
Voted
APAL
2011
14 years 9 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
119
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...