Sciweavers

6740 search results - page 171 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
APPML
2006
71views more  APPML 2006»
13 years 10 months ago
Distance distribution of nodes in star graphs
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 10 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
COMBINATORICS
2000
120views more  COMBINATORICS 2000»
13 years 10 months ago
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
Elias M. Hagos
SAC
2009
ACM
14 years 5 months ago
Extending Problem Frames to deal with stakeholder problems
The Problem Frames approach captures problems as seen by developers, but not by stakeholders. This paper presents a framework that extends the problem diagram of the Problem Frame...
An Agent, Goal-Oriented Approach
ICIP
2010
IEEE
13 years 8 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...