6740 search results - page 257 / 1348 » An s -Hamiltonian Line Graph Problem |
118
Voted
MP
2006
15 years 22 days ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
119
Voted
SIGSOFT
1994
ACM
15 years 4 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
84
Voted
SIAMDM
2010
14 years 11 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
ESA
2008
Springer
15 years 2 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
106
click to vote
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....