Result: The structure and number of global roundings of a graph
Title:
The structure and number of global roundings of a graph
Authors:
Source:
Selected Papers from COCOON 2003Theoretical computer science. 325(3):425-437
Publisher Information:
Amsterdam: Elsevier, 2004.
Publication Year:
2004
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Assignation, Assignment, Asignación, Ensemble indépendant, Independent set, Conjunto independiente, Graphe connexe, Connected graph, Grafo conexo, Hypergraphe, Hypergraph, Hipergráfico, Informatique théorique, Computer theory, Informática teórica, Méthode combinatoire, Combinatorial method, Método combinatorio, Plus court chemin, Shortest path, Camino más corto, 05C65, 68R10, Chemin plus court, Discrépancie, Discrepancy
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Japan
Graduate School of Engineering, Kyoto University, Kyoto, Japan
School of Science and Technology, Meiji University, Kawasaki, Japan
Graduate School of Information Sciences, Tohoku University, Aoba-ku, Aramaki, Aza-Aoba 09, Sendai, Miyagi 980-8577, Japan
Graduate School of Engineering, Kyoto University, Kyoto, Japan
School of Science and Technology, Meiji University, Kawasaki, Japan
Graduate School of Information Sciences, Tohoku University, Aoba-ku, Aramaki, Aza-Aoba 09, Sendai, Miyagi 980-8577, Japan
ISSN:
0304-3975
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.16145763
Database:
PASCAL Archive
Further Information
Given a connected weighted graph G = (V, E), we consider a hypergraph HG = (V, PG) corresponding to the set of all shortest paths in G. For a given real assignment a on V satisfying 0≤a(v) ≤ 1, a global rounding a with respect to HG is a binary assignment satisfying that |Σv∈Fa(v)-α(v) < 1 for every F E PG. We conjecture that there are at most |V| + 1 global roundings for HG, and also the set of global roundings is an affine independent set. We give several positive evidences for the conjecture.