Cordial labelling of butterfly networks and mesh of trees
- Authors: Miller, Mirka , Rajan, Bharati , Rajasingh, Indra , Manuel, Paul
- Date: 2006
- Type: Text , Conference paper
- Relation: Paper presented at AWOCA 2006, 17th Australasian Workshop on Combinatorial Algorithms, Uluru, Australia : 13th July, 2006
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001646
Super edge-magic total labeling of spiked fans, hyper x-trees, dew drops and prisms
- Authors: Miller, Mirka , Rajasingh, Indra , Rajan, Bharati , Manuel, Paul
- Date: 2006
- Type: Text , Conference paper
- Relation: Paper presented at AWOCA 2006, 17th Australasian Workshop on Combinatorial Algorithms, Uluru, Australia : 13th July, 2006 p. 13-25
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001919
Parallel algorithms for generalized clique transversal problems
- Authors: Miller, Mirka , Dahlhaus, Elias , Manuel, Paul
- Date: 2005
- Type: Text , Journal article
- Relation: Australasian Journal of Combinatorics Vol. 33, no. (2005), p. 3-14
- Full Text: false
- Reviewed:
- Description: The K ` - clique transversal problem is to locate a minimum collection of cliques of size ` in a graph G such that every maximal clique of size ` in G contains at least one member of the collection. We give an NC algorithm to solve this problem on strongly chordal graphs. Keywords: balanced graphs, strongly chordal graphs, clique transversal, k-fold clique transversal, K ` - clique transversal. 1 Introduction A 0 Gamma 1 matrix is balanced if it does not contain as a submatrix, an edge - vertex incidence matrix of an odd cycle. A 0 Gamma 1 matrix is totally balanced if it does not contain as a submatrix, an edge - vertex incidence matrix of any cycle. A hypergraph H is an ordered pair (V; E) where V is a set of vertices and E is a family of subsets of V . The members of E are called hyperedges of H . Let V = fv 1 ; v 2 ; : : : ; v n g and E = fE 1 ; E 2 ; : : : ; Em g. Let A(H) denote the hyperedge - vertex incidence matrix of a hypergraph H .
- Description: C1
- Description: 2003001400