Result: Sparse connectivity certificates via MA orderings in graphs
Title:
Sparse connectivity certificates via MA orderings in graphs
Authors:
Source:
Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto UniversityDiscrete applied mathematics. 154(16):2411-2417
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, 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, Arbre maximal, Spanning tree, Arbol máximo, Connectivité graphe, Graph connectivity, Conectividad grafo, Fonction poids, Weight function, Función peso, Graphe connexe, Connected graph, Grafo conexo, Informatique théorique, Computer theory, Informática teórica, Matrice creuse, Sparse matrix, Matriz dispersa, Multigraphe, Multigraph, Multígrafo, Temps linéaire, Linear time, Tiempo lineal, Certificat connectivité, Connectivity certificate, Coupe mixte, Mixed cut, Relation ordre MA, MA ordering, Connectivity certificates, Edge-connectivity, MA orderings, Mixed cuts, Removable cycles, Spanning subgraphs, Vertex-connectivity
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Applied Mathematics and Physics, Kyoto University, Yoshida Honmachi, Sakyo, Kyoto 606-8501, Japan
ISSN:
0166-218X
Rights:
Copyright 2006 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.18240654
Database:
PASCAL Archive
Further Information
For an undirected multigraph G = (V, E), let α be a positive integer weight function on V. For a positive integer k, G is called (k, α)-connected if any two vertices u, v ∈ V remain connected after removal of any pair (Z, E') of a vertex subset Z ⊆ V - {u, v} and an edge subset E' ⊆ E such that Σv∈zα(v) + |E'| <k. The (k, α)-connectivity is an extension of several common generalizations of edge-connectivity and vertex-connectivity. Given a (k, α)-connected graph G, we show that a (k, α)-connected spanning subgraph of G with P(k|V|) edges can be found in linear time by using MA orderings. We also show that properties on removal cycles and preservation of minimum cuts can be extended in the (k, α)-connectivity.