684 search results - page 19 / 137 » A characterization of b-perfect graphs |
132
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
109
click to vote
PCI
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
112
click to vote
TAGT
1994
Springer
15 years 5 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
140
click to vote
DAM
1999
15 years 1 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
128
Voted
DM
2002
15 years 1 months ago
2002
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...