Connectivity, independent sets and maximal circuits in undirected graphs

Connectivity, independent sets and maximal circuits in undirected graphs

Bibliographic Details
Main Author:	Ainouche, A.
Published:	Imperial College London 1981
Online Access:	http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.688409

Similar Items

Infinite Ergodic Walks in Finite Connected Undirected Graphs
by: Dimitri Volchenkov
Published: (2021-02-01)

The p-center location problem on undirected connected graphs
by: Tzung-Shiun Wu, et al.
Published: (2015)

Deciding st-connectivity in undirected graphs using logarithmic space
by: Maceli, Peter Lawson
Published: (2008)

A linear systolic algorithm for finding bridges on an undirected connected graph
by: XIE, XUN-FEN, et al.
Published: (1989)

Distributed algorithms on rooted undirected graphs
by: I. Burdonov, et al.
Published: (2018-10-01)

Completely Described Undirected Graph Structure
by: G. S. Ivanova, et al.
Published: (2016-01-01)

Maximal funnel-node flows in an undirected network
by: Miller, Duane David
Published: (2008)

Approximate cycles count in undirected graphs
by: Maytham Safar, et al.
Published: (2014-04-01)

Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph
by: Maxwell, Sean T.
Published: (2014)

A SLAM Map Restoration Algorithm Based on Submaps and an Undirected Connected Graph
by: Zongqian Zhan, et al.
Published: (2021-01-01)

On topological spaces generated by simple undirected graphs
by: Hatice Kübra Sarı, et al.
Published: (2020-07-01)

Locating absolute 2-centers of undirected graphs.
by: Gillespie, Clark McKinley
Published: (2012)

On the Metric Dimension of Directed and Undirected Circulant Graphs
by: Vetrík Tomáš
Published: (2020-02-01)

Finding Dense 2-clubs in an Undirected Graph
by: Yu-Fen Tseng, et al.
Published: (2016)

Hardness of Approximate Diameter: Now for Undirected Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2022)

AN INTEGRAL CONNECTIVITY CONDITION FOR MULTI-EQUILIBRIA CONSENSUS IN NETWORKS EVOLVING OVER UNDIRECTED GRAPHS
by: Özlem Feyza Erkan, et al.
Published: (2017-10-01)

Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.
by: Levine, Matthew S. (Matthew Steven)
Published: (2005)

On the Sizes of Maximal Independent Sets of Cylindrical Grid Graphs
by: R.M. BARBOSA, et al.

Counting Maximal Distance-Independent Sets in Grid Graphs
by: Euler Reinhardt, et al.
Published: (2013-07-01)

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure
by: M. Hadian Dehkordi, et al.
Published: (2008-07-01)

Packing Coloring of Some Undirected and Oriented Coronae Graphs
by: Laïche Daouya, et al.
Published: (2017-08-01)

On Zero-Sum Flows and Flow Numbers of Undirected Graphs
by: Shih-Wei Hu, et al.
Published: (2013)

A Generalization of the Importance of Vertices for an Undirected Weighted Graph
by: Ronald Manríquez, et al.
Published: (2021-05-01)

Undirected Graphs: Is the Shift-Enabled Condition Trivial or Necessary?
by: Liyan Chen, et al.
Published: (2021-01-01)

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
by: Massoud Hadian Dehkordi, et al.
Published: (2008-03-01)

Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
by: Maumita Chakraborty, et al.
Published: (2018-01-01)

Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
by: Alan Bojić
Published: (2012-12-01)

Link scheduling directed graphs using undirected edge colours
by: d'Oliveira, Kyle
Published: (2012)

Link scheduling directed graphs using undirected edge colours
by: d'Oliveira, Kyle
Published: (2012)

The search for minimal edge 1-extension of an undirected colored graph
by: Razumovsky, Peter Vladimirovich
Published: (2021-08-01)

Link scheduling directed graphs using undirected edge colours
by: d'Oliveira, Kyle
Published: (2012)

Prufer Coding: A Vectorization Method for Undirected Labeled Graph
by: Lin Yang, et al.
Published: (2020-01-01)

Efficient orbit-aware triad and quad census in directed and undirected graphs
by: Mark Ortmann, et al.
Published: (2017-06-01)

Space-Efficient Fully Dynamic DFS in Undirected Graphs <sup>†</sup>
by: Kengo Nakamura, et al.
Published: (2019-02-01)

Triangle counting and listing in directed and undirected graphs using single machines
by: Santoso, Yudi
Published: (2018)

Cooperative fault estimation for linear multi-agent systems with undirected graphs
by: Hao Li, et al.
Published: (2016-06-01)

Adaptive constraint control for nonlinear multi-agent systems with undirected graphs
by: Lu Zhi, et al.
Published: (2021-08-01)

COMPUTING TOP-K CLOSENESS CENTRALITY IN UNWEIGHTED UNDIRECTED GRAPHS REVISITED
by: Al-Baghdadi, Ahmed
Published: (2017)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
by: Nesrine Abbas, et al.
Published: (2005-12-01)

Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
by: Christiano, Paul F., et al.
Published: (2012)

Cannot write session to /tmp/vufind_sessions/sess_oufg9jne82fml6jnfglosg9maa