5100 search results - page 108 / 1020 » The Linear Complexity of a Graph |
JACM
2000
13 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
FSTTCS
2005
Springer
14 years 2 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
NAACL
2010
13 years 7 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...