Sciweavers

6740 search results - page 5 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
TCS
2011
13 years 2 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 7 months ago
Principal Graphs and Manifolds
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
Alexander N. Gorban, Andrei Yu. Zinovyev
COMPUTING
1999
99views more  COMPUTING 1999»
13 years 7 months ago
A Minimal Line Property Preserving Representation of Line Images
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
Mark Burge, Walter G. Kropatsch
JGT
2008
97views more  JGT 2008»
13 years 7 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík